Equitable Colorings of Planar Graphs without Short Cycles

Keaitsuda Nakprasit, Kittikorn Nakprasit

An \emph{equitable coloring} of a graph is a proper vertex coloring such that the sizes of every two color classes differ by at most 1. Chen, Lih, and Wu conjectured that every con…