Kevin Hendrey

activity

20152026

most citedBounds for the Twin-width of Graphs

15 citations · 73 across the 38 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

math.CO2018★ 4 cited

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★ 14 cited

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 $…