Kevin Hendrey

activity

20162022

collaborators

5 papers

math.CO2022

Graphs of Linear Growth have Bounded Treewidth

Rutger Campbell, Marc Distel, J. Pascal Gollin +5

A graph class $G$ has linear growth if, for each graph $G \in G$ and every positive integer $r$ , every subgraph of $G$ with radius at most $r$ contains $O (r)$ v…

math.CO2021

Counting cliques in $1$ -planar graphs

J. Pascal Gollin, Kevin Hendrey, Abhishek Methuku +2

The problem of maximising the number of cliques among $n$ -vertex graphs from various graph classes has received considerable attention. We investigate this problem for the class of…

math.CO2018

Covering radius in the Hamming permutation space

Kevin Hendrey, Ian M. Wanless

Let $S_{n}$ denote the set of permutations of ${1, 2, \dots, n}$ . The function $f (n, s)$ is defined to be the minimum size of a subset $S \subseteq S_{n}$ with the pro…

math.CO2018

Defective and Clustered Choosability of Sparse Graphs

Kevin Hendrey, David R. Wood

An (improper) graph colouring has "defect" $d$ if each monochromatic subgraph has maximum degree at most $d$ , and has "clustering" $c$ if each monochromatic component has at most $…

math.CO2016

Sparse graphs of high gonality