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...
| Autors principals: | , , , |
|---|---|
| Format: | Journal article |
| Idioma: | English |
| Publicat: |
Springer
2019
|