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...
Main Authors: | Norin, S, Scott, A, Seymour, P, Wood, DR |
---|---|
Format: | Journal article |
Sprog: | English |
Udgivet: |
Springer
2019
|
Lignende værker
-
Clustered colouring of graph classes with bounded treedepth or pathwidth
af: Norin, S, et al.
Udgivet: (2022) -
On the critical densities of minor-closed classes
af: McDiarmid, C, et al.
Udgivet: (2018) -
On the purity of minor-closed classes of graphs
af: McDiarmid, C, et al.
Udgivet: (2018) -
Random Graphs from a Minor-Closed Class.
af: McDiarmid, C
Udgivet: (2009) -
Random graphs from a weighted minor-closed class
af: McDiarmid, C
Udgivet: (2012)