Equitable Colorings of $K\_4$-minor-free Graphs

Rémi De Joannis de Verclos, Jean-Sébastien Sereni

We demonstrate that for every positive integer $\Delta$, every K\_4-minor-free graph with maximum degree $\Delta$ admits an equitable coloring with k colors wherek $\ge$ ($\Delta$+3)/2. This boun…