Prefer a chat interface with context about you and your work?
Clustered colouring of graph classes with bounded treedepth or pathwidth
Abstract The clustered chromatic number of a class of graphs is the minimum integer $k$ such that for some integer $c$ every graph in the class is $k$ -colourable with monochromatic components of size at most $c$ . We determine the clustered chromatic number of any minor-closed class with bounded …