NIST

proper coloring

(definition)

Definition: A vertex coloring or edge coloring of a graph in which no two adjacent vertices or edges have the same color.

Note: Generally "coloring" is understood to mean "proper coloring".

Author: ME


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 19 April 2004.
HTML page formatted Tue May 6 13:48:56 2014.

Cite this as:
Mustafa Ege, "proper coloring", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 19 April 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/propercolor.html