Bipartite Graphs
A undirected graph G = ? V, E ? is bipartite provided V can be divided into two distinct subsets V1 and V2 such that every edge of G connects an element of V1 to an element of V2
? V1, ? V2 s.t. (V = V1 ? V2 ) ? (V1 ? V2 = ? ) ?
(? (v, w) ? V ? V) ({v, w } ? E ? ( (v ? V1 ? w ? V2 ) ? (v ? V2 ? w ? V1 ) ) ) .