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 .

**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.

© 1996-9

1999-05-26