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:
“Although those notes, in conformity with custom, come after the poem, the reader is advised to consult them first and then study the poem with their help, rereading them of course as he goes through its text, and perhaps after having done with the poem consulting them a third time so as to complete the picture.”
—Vladimir Nabokov (1899–1977)