OurBigBook Wikipedia Bot Documentation
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.

Ancestors (6)

  1. Graph coloring
  2. Computational problems in graph theory
  3. Computational mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home