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:
“What I expect from my male friends is that they are polite and clean. What I expect from my female friends is unconditional love, the ability to finish my sentences for me when I am sobbing, a complete and total willingness to pour their hearts out to me, and the ability to tell me why the meat thermometer isn’t supposed to touch the bone.”
—Anna Quindlen (20th century)