Equitable coloring of sparse planar graphs

Rong Luo, Jean-Sébastien Sereni, D. Christopher Stephens +1

A proper vertex coloring of a graph $G$ is equitable if the sizes of color classes differ by at most one. The equitable chromatic threshold ${\chi }_{eq}^{\ast }(G)$ of $G$ is the smallest int…