Definition: An assignment of colors (or any distinct marks) to the vertices of a graph. Strictly speaking, a coloring is proper if no two adjacent vertices have the same color.
See also edge coloring, k-coloring, vertex cover, chromatic number.
Note: From Algorithms and Theory of Computation Handbook, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 2 September 2014.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black and Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "vertex coloring", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 2 September 2014. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/vertexcolor.html