Clustered Colouring of Odd-$H$-Minor-Free Graphs

Robert Hickingbotham, Dong Yeap Kang, Sang-il Oum +2

The clustered chromatic number of a graph class $\mathcal{G}$ is the minimum integer $c$ such that every graph $G\in \mathcal{G}$ has a $c$-colouring where each monochromatic compon…