Two lower bounds for $p$-centered colorings

Loïc Dubois, Gwenaël Joret, Guillem Perarnau +2

Given a graph $G$ and an integer $p$, a coloring $f:V(G)\to \mathbb{N}$ is \emph{$p$-centered} if for every connected subgraph $H$ of $G$, either $f$ uses more than $p$ colors o…