A Bipartite Graph (i.e., a set of Vertices decomposed into two disjoint sets such that there are no two Vertices within the same set are adjacent) such that every pair of Vertices in the two sets are adjacent. If there are and Vertices in the two sets, the complete bipartite graph (sometimes also called a Complete Bigraph) is denoted . The above figures show and .

**References**

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