ABSTRACT
A graph G is said to be bipartite if V (G) can be divided into two sets X and Y such that each edge has one end in X and one end in Y . For example, the cube is a bipartite graph, where the bipartition (X,Y ) is illustrated by the coloring of the nodes in Figure 4.1.
