Bipartite graphs reveal special algorithms. The most famous is maximum bipartite matching. Given a bipartite graph, find the largest set of edges such that no node appears twice. This solves job assignment, resource allocation, and scheduling problems. You will learn matching algorithms in later sections.
For now, know that detecting bipartite structure is the first step. If the graph is not bipartite, matching algorithms do not apply.