Equitably Coloring Planar and Outerplanar Graphs

Daniel W. Cranston, Reem Mahmoud

A proper $s$-coloring of an $n$-vertex graph is \emph{equitable} if every color class has size $\lfloor n/s\rfloor$ or $\lceil n/s\rceil$. A necessary condition to have an equita…