|
|
|
A 
-partite graph is a Graph whose Vertices can be partitioned
into disjoint sets so that no two vertices within the same set are adjacent.
See also Complete k-Partite Graph, K-Graph
References
Saaty, T. L. and Kainen, P. C. The Four-Color Problem: Assaults and Conquest. New York: Dover, p. 12, 1986.