NIST

vertex coloring

(definition)

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.

Authors: PEB,CRC-A

Implementation

(Fortran, C, Pascal, C++, and Mathematica)
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 2 September 2014.
HTML page formatted Fri Feb 23 10:06:08 2018.

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], Vreda Pieterse and Paul E. Black, eds. 2 September 2014. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/vertexcolor.html