## Complete k-Partite Graph

A k-Partite Graph (i.e., a set of Vertices decomposed into disjoint sets such that no two Vertices within the same set are adjacent) such that every pair of Vertices in the sets are adjacent. If there are , , ..., Vertices in the sets, the complete -partite graph is denoted . The above figure shows .

References

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