research
∙
04/17/2022
Optimally Reconfiguring List and Correspondence Colourings
The reconfiguration graph 𝒞_k(G) for the k-colourings of a graph G has a...
share
research
∙
10/11/2021
Packing list-colourings
List colouring is an influential and classic topic in graph theory. We i...
research
∙
08/04/2020
Minimum maximal matchings in cubic graphs
We prove that every connected cubic graph with n vertices has a maximal ...
research
∙
01/13/2020
Packing and covering balls in graphs excluding a minor
We prove that for every integer t> 1 there exists a constant c_t such th...
research
∙
12/31/2019
Structure and colour in triangle-free graphs
Motivated by a recent conjecture of the first author, we prove that ever...
research
∙
12/17/2019
Erdős-Pósa from ball packing
A classic theorem of Erdős and Pósa (1965) states that every graph has e...
research
∙
11/28/2019
Large independent sets in triangle-free cubic graphs: beyond planarity
Every n-vertex planar triangle-free graph with maximum degree at most 3 ...
research
∙
05/15/2019
Strong chromatic index and Hadwiger number
We investigate the effect of a fixed forbidden clique minor upon the str...
research
∙
08/07/2018
Bipartite induced density in triangle-free graphs
Any triangle-free graph on n vertices with minimum degree at least d con...
research
∙
07/13/2018
