4 papers · 1 filter
Treewidth 2 in the Planar Graph Product Structure Theorem
Marc Distel, Kevin Hendrey, Nikolai Karol +2
We prove that every planar graph is contained in for some graphs and both with treewidth 2. This resolves a question of Liu, Norin and W…
Treewidth, Hadwiger Number, and Induced Minors
Rutger Campbell, James Davies, Marc Distel +7
Treewidth and Hadwiger number are two of the most important parameters in structural graph theory. This paper studies graph classes in which large treewidth implies the existence o…
Clustered Colouring of Graph Products
Rutger Campbell, J. Pascal Gollin, Kevin Hendrey +5
A colouring of a graph has clustering if the maximum number of vertices in a monochromatic component equals . Motivated by recent results showing that many natural graph…
Defective and Clustered Colouring of Graphs with Given Girth
Marcin Briański, Robert Hickingbotham, David R. Wood
The defective chromatic number of a graph class is the minimum integer such that for some integer , every graph in is -colourable such that ea…