A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. The most common type of vertex coloring seeks to minimize the number of colors for a given graph. Such a coloring is known as a minimum vertex coloring, and the minimum number of colors which with the vertices of a graph G may be colored is called the chromatic number, denoted χ(G).

Brelaz's heuristic algorithm | Brooks' theorem | chromatic number | chromatic polynomial | coloring | edge chromatic number | edge coloring | four-color theorem | graph coloring | k-chromatic graph | k-colorable graph | k-coloring | labeled graph | minimum edge coloring | minimum vertex coloring