Equitable coloring

ID: equitable-coloring

Equitable coloring is a concept in graph theory that deals with coloring the vertices of a graph such that the sizes of the color classes are as equal as possible. Specifically, in an equitable coloring of a graph, the vertices are assigned colors in such a way that the number of vertices of each color differs by at most one.

New to topics? Read the docs here!