1 paper
Guilherme C. M. Gomes, Matheus R. Guedes, Vinicius F. dos Santos
An n-vertex graph is equitably k-colorable if there is a proper coloring of its vertices such that each color is used either ⌊n/k⌋ or $\left\lceil n/…