Complete coloring
|
|
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. The achromatic number ψ(G) of a graph G is the maximum number of colors needed for any complete coloring of G.
External links
[1] (http://www.maths.dundee.ac.uk/~kedwards/biblio.html) A Bibliography of Harmonious Colourings and Achromatic Number by Keith Edwards