5 citations · 5 across the 6 of their papers we have counts for
6 papers
Short Paths in the Planar Graph Product Structure Theorem
Kevin Hendrey, David R. Wood
The Planar Graph Product Structure Theorem of Dujmović et al. [J. ACM '20] says that every planar graph is contained in for some planar graph wi…
Metric graphs of negative type
Rutger Campbell, Kevin Hendrey, Ben Lund +1
The negative type inequalities of a metric space are closely tied to embeddability. A result by Gupta, Newman, and Rabinovich implies that if a metric graph does not contain a…
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…
Product structure of graph classes with bounded treewidth
Rutger Campbell, Katie Clinch, Marc Distel +8
We show that many graphs with bounded treewidth can be described as subgraphs of the strong product of a graph with smaller treewidth and a bounded-size complete graph. To this end…