In graph theory, complete coloring is the opposite of harmonious coloring in the sense that it is a vertex coloring in which every pair of colors appears on at least one pair of adjacent vertices. Equivalently, a complete coloring is minimal in the sense that it cannot be transformed into a proper coloring with fewer colors by merging pairs of color classes. The achromatic number ψ(G) of a graph G is the maximum number of colors possible in any complete coloring of G.
Read more about Complete Coloring: Complexity Theory, Algorithms, Special Classes of Graphs
Famous quotes containing the word complete:
“In the course of the actual attainment of selfish ends—an attainment conditioned in this way by universality—there is formed a system of complete interdependence, wherein the livelihood, happiness, and legal status of one man is interwoven with the livelihood, happiness, and rights of all. On this system, individual happiness, etc. depend, and only in this connected system are they actualized and secured.”
—Georg Wilhelm Friedrich Hegel (1770–1831)