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:
“Silence is to all creatures thus attacked the only means of salvation; it fatigues the Cossack charges of the envious, the enemy’s savage ruses; it results in a cruising and complete victory.”
—Honoré De Balzac (1799–1850)