15 citations · 73 across the 38 of their papers we have counts for
7 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…
Optimal bounds for zero-sum cycles. I. Odd order
Rutger Campbell, J. Pascal Gollin, Kevin Hendrey +1
For a finite (not necessarily Abelian) group , let denote the smallest positive integer such that for every labelling of the arcs of the comple…
When -intersecting hypergraphs admit bounded -strong colourings
Kevin Hendrey, Freddie Illingworth, Nina Kamčev +1
The -strong chromatic number of a hypergraph is the smallest number of colours needed to colour its vertices so that every edge sees at least colours or is rainbow. We show…
Sharing tea on a graph
J. Pascal Gollin, Kevin Hendrey, Hao Huang +6
Motivated by the analysis of consensus formation in the Deffuant model for social interaction, we consider the following procedure on a graph . Initially, there is one unit of t…
Linear bounds on treewidth in terms of excluded planar minors
J. Pascal Gollin, Kevin Hendrey, Sang-il Oum +1
One of the fundamental results in graph minor theory is that for every planar graph , there is a minimum integer such that graphs with no minor isomorphic to have tre…