The chromatic number of a graph is the minimum number of colors needed to color the vertices of a graph so that no adjacent vertices have the same color. This topic explores the chromatic number of complete graphs.
The chromatic number of a graph is the minimum number of colors needed to color the vertices of a graph so that no adjacent vertices have the same color. This topic explores the chromatic number of complete graphs.