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".
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 19 April 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Mustafa Ege, "proper coloring", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 19 April 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/propercolor.html