REVIEW 1 cited by
Islands in minor-closed classes. I. Bounded treewidth and separators
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
The clustered chromatic number of a graph class is the minimum integer $t$ such that for some $C$ the vertices of every graph in the class can be colored in $t$ colors so that every monochromatic component has size at most $C$. We show that the clustered chromatic number of the class of graphs embeddable on a given surface is four, proving the conjecture of Esperet and Ochem. Additionally, we study the list version of the concept and characterize the minor-closed classes of graphs of bounded treewidth with given clustered list chromatic number. We further strengthen the above results to solve some extremal problems on bootstrap percolation of minor-closed classes.
Forward citations
Cited by 1 Pith paper
-
3-Colouring Planar Graphs
Every n-vertex planar graph can be 3-coloured so that each monochromatic connected component has at most O(n^{4/9}) vertices, improving the previous O(n^{1/2}) bound.
Discussion (0). Continue with ORCID to comment.