📝 SummarXiv

Abstract

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 equitable $s$-coloring is that every vertex $v$ appears in an independent set of size at least $\lfloor{n/s}\rfloor$. That is $\min_{v\in V(G)}\alpha_v\ge \lfloor{n/s}\rfloor$. Various authors showed that when $G$ is a tree and $s\ge 3$ this obvious necessary condition is also sufficient. Kierstead, Kostochka, and Xiang asked whether this result holds more generally for all outerplanar graphs. We show that the answer is No when $s=3$, but that the answer is Yes when $s\ge 6$. The case $s\in\{4,5\}$ remains open. We also prove an analogous result for planar graphs, with a necessary and sufficient hypothesis. Fix $s\ge 40$. Let $G$ be a planar graph, and let $w_0,w_1$ be its $2$ vertices with largest degrees. If there exist disjoint independent sets $I_0, I_1$ such that $|I_0|=\lfloor{n/s}\rfloor$ and $|I_1| = \lfloor{(n+1)/s}\rfloor$ and $w_0,w_1\in I_0\cup I_1$, then $G$ has an equitable $s$-coloring.