16 citations · 19 across the 3 of their papers we have counts for
5 papers
Universality in minor-closed graph classes
Tony Huynh, Bojan Mohar, Robert Šámal +2
Stanislaw Ulam asked whether there exists a universal countable planar graph (that is, a countable planar graph that contains every countable planar graph as a subgraph). János Pa…
Clustered Graph Coloring and Layered Treewidth
Chun-Hung Liu, David R. Wood
A graph coloring has bounded clustering if each monochromatic component has bounded size. This paper studies such a coloring, where the number of colors depends on an excluded comp…
The grid-minor theorem revisited
Vida DujmoviÄ, Robert Hickingbotham, JÄdrzej Hodor +6
We prove that for every planar graph of treedepth , there exists a positive integer such that for every -minor-free graph , there exists a graph of treewidth a…
Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
Ãdouard Bonnet, O-joung Kwon, David R. Wood
In a reduction sequence of a graph, vertices are successively identified until the graph has one vertex. At each step, when identifying and , each edge incident to exactly o…
Clustered Colouring of Odd--Minor-Free Graphs
Robert Hickingbotham, Dong Yeap Kang, Sang-il Oum +2
The clustered chromatic number of a graph class is the minimum integer such that every graph has a -colouring where each monochromatic compon…