1.Previous
3.Next

Bipartite graphs may be characterized in several different ways:
* An undirected graph is bipartite if and only if it does not contain an odd cycle.
* A graph is bipartite if and only if it is 2-colorable, (i.e. its chromatic number is less than or equal to 2).
* A graph is bipartite if and only if every edge belongs to an odd number of bonds, minimal

1.Previous
3.Next