Clustered Colouring in Minor-Closed Classes

Sergey Norin; Alex Scott; Paul Seymour; David R. Wood

doi:10.1007/s00493-019-3848-z

Clustered Colouring in Minor-Closed Classes

Sergey Norin, Alex Scott, Paul Seymour, David R. Wood

Mathematics

Princeton University

Research output: Contribution to journal › Article › peer-review

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 prove that for every graph H, the clustered chromatic number of the class of H-minor-free graphs is tied to the tree-depth of H. In particular, if H is connected with tree-depth t, then every H-minor-free graph is (2^t+1–4)-colourable with monochromatic components of size at most c(H). This provides the first evidence for a conjecture of Ossona de Mendez, Oum and Wood (2016) about defective colouring of H-minor-free graphs. If t = 3, then we prove that 4 colours suffie, which is best possible. We also determine those minor-closed graph classes with clustered chromatic number 2. Finally, we develop a conjecture for the clustered chromatic number of an arbitrary minor-closed class.

Original language	American English
Pages (from-to)	1387-1412
Number of pages	26
Journal	Combinatorica
Volume	39
Issue number	6
DOIs	https://doi.org/10.1007/s00493-019-3848-z
State	Published - Dec 1 2019

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Computational Mathematics

Access to Document

10.1007/s00493-019-3848-z

Cite this

@article{8915bd4b3b1048f594f6cfd393b3434b,

title = "Clustered Colouring in Minor-Closed Classes",

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 prove that for every graph H, the clustered chromatic number of the class of H-minor-free graphs is tied to the tree-depth of H. In particular, if H is connected with tree-depth t, then every H-minor-free graph is (2t+1–4)-colourable with monochromatic components of size at most c(H). This provides the first evidence for a conjecture of Ossona de Mendez, Oum and Wood (2016) about defective colouring of H-minor-free graphs. If t = 3, then we prove that 4 colours suffie, which is best possible. We also determine those minor-closed graph classes with clustered chromatic number 2. Finally, we develop a conjecture for the clustered chromatic number of an arbitrary minor-closed class.",

author = "Sergey Norin and Alex Scott and Paul Seymour and Wood, {David R.}",

note = "Publisher Copyright: {\textcopyright} 2019, J{\'a}nos Bolyai Mathematical Society and Springer-Verlag Berlin Heidelberg.",

year = "2019",

month = dec,

day = "1",

doi = "10.1007/s00493-019-3848-z",

language = "American English",

volume = "39",

pages = "1387--1412",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Janos Bolyai Mathematical Society",

number = "6",

}

TY - JOUR

T1 - Clustered Colouring in Minor-Closed Classes

AU - Norin, Sergey

AU - Scott, Alex

AU - Seymour, Paul

AU - Wood, David R.

PY - 2019/12/1

Y1 - 2019/12/1

N2 - 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 tied to the tree-depth of H. In particular, if H is connected with tree-depth t, then every H-minor-free graph is (2t+1–4)-colourable with monochromatic components of size at most c(H). This provides the first evidence for a conjecture of Ossona de Mendez, Oum and Wood (2016) about defective colouring of H-minor-free graphs. If t = 3, then we prove that 4 colours suffie, which is best possible. We also determine those minor-closed graph classes with clustered chromatic number 2. Finally, we develop a conjecture for the clustered chromatic number of an arbitrary minor-closed class.

AB - 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 tied to the tree-depth of H. In particular, if H is connected with tree-depth t, then every H-minor-free graph is (2t+1–4)-colourable with monochromatic components of size at most c(H). This provides the first evidence for a conjecture of Ossona de Mendez, Oum and Wood (2016) about defective colouring of H-minor-free graphs. If t = 3, then we prove that 4 colours suffie, which is best possible. We also determine those minor-closed graph classes with clustered chromatic number 2. Finally, we develop a conjecture for the clustered chromatic number of an arbitrary minor-closed class.

UR - http://www.scopus.com/inward/record.url?scp=85074670491&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85074670491&partnerID=8YFLogxK

U2 - 10.1007/s00493-019-3848-z

DO - 10.1007/s00493-019-3848-z

M3 - Article

SN - 0209-9683

VL - 39

SP - 1387

EP - 1412

JO - Combinatorica

JF - Combinatorica

IS - 6

ER -

Clustered Colouring in Minor-Closed Classes

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this