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 my parents have never been the kind to hint around about grandchildren, I can think of no better tribute to them than giving them some.... I can’t help thinking that the cycle is not complete until I can introduce them to a child of their child. And I can think of no better comfort when they are gone than to know that something of them lives on, not only in me but in my children.”
—Anne Cassidy. “Every Child Should Have a Father But....,” McCall’s (March 1985)