Bipartite graphs
A simple graph G is called bipartite if its vertex set V can be partitioned
into two disjoint nonempty sets V1 and V2 such that every edge in the
graph connects a vertex in V1 and a vertex in V2 (so that no edge
connects two vertices in V1, or in V2).