Clustered colouring in minor-closed classes

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 prove that for every graph H, the clustered chromatic number of the class of H-minor-free graphs is t...

Полное описание

Библиографические подробности
Главные авторы: Norin, S, Scott, A, Seymour, P, Wood, DR
Формат: Journal article
Язык:English
Опубликовано: Springer 2019