David R. Wood

Clustered coloring of graphs excluding a subgraph and a minor

A graph coloring has bounded clustering if each monochromatic component has bounded size. Equivalently, it is a partition of the vertices into induced subgraphs with bounded size components. This paper studies clustered colorings of graphs, where the number of colors depends on a...