Bipartite Graph

$\begin{figure}\begin{center}\BoxedEPSF{BipartiteGraph.epsf}\end{center}\end{figure}$

A set of Vertices decomposed into two disjoint sets such that no two Vertices within the same set are adjacent. A bigraph is a special case of a k-Partite Graph with .

See also Complete Bipartite Graph, k-Partite Graph, König-Egeváry Theorem

References

Chartrand, G. Introductory Graph Theory. New York: Dover, p. 116, 1985.

Saaty, T. L. and Kainen, P. C. The Four-Color Problem: Assaults and Conquest. New York: Dover, p. 12, 1986.