18 citations · 62 across the 29 of their papers we have counts for
5 papers · 1 filter
Cop-width, flip-width and strong colouring numbers
Robert Hickingbotham
Cop-width and flip-width are new families of graph parameters introduced by Toruńczyk (2023) that generalise treewidth, degeneracy, generalised colouring numbers, clique-width and…
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…
Powers of planar graphs, product structure, and blocking partitions
Marc Distel, Robert Hickingbotham, Michał T. Seweryn +1
We prove that the -power of any planar graph is contained in for some graph with bounded treewidth, some path , and some functio…
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…
The Excluded Tree Minor Theorem Revisited
Vida Dujmović, Robert Hickingbotham, Gwenaël Joret +3
We prove that for every tree of radius , there is an integer such that every -minor-free graph is contained in for some graph with pathwidth at m…