Equitable Coloring of Graphs with Intermediate Maximum Degree

Bor-Liang Chen, Kuo-Ching Huang, Ko-Wei Lih

If the vertices of a graph $G$ are colored with $k$ colors such that no adjacent vertices receive the same color and the sizes of any two color classes differ by at most one, then…