Bipartite Graphs

A Graph G is Bipartite if its vertices can be partitioned into two disjoint sets L and R such that Every edge of G connects a vertex in L to a vertex in R No edge connects two vertices from the same part L and R are called the parts of G Example:...