Chromatic number (idea)

In combinatorics, the chromatic number (gamma of G) of a graph is the smallest number of colors such that colors can be assigned to all nodes of the graph without having connected nodes with the same color.

--back to combinatorics--