(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
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 19 April 2004.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Mustafa Ege, "proper coloring", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 19 April 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/propercolor.html
