Improved bounds for centered colorings

Michał Dębski, Stefan Felsner, Piotr Micek +1

A vertex coloring $\varphi$ of a graph $G$ is $p$-centered if for every connected subgraph $H$ of $G$ either $\varphi$ uses more than $p$ colors on $H$ or there is a color that appears exactly…