research
∙
08/28/2023
A precise condition for independent transversals in bipartite covers
Given a bipartite graph H=(V=V_A∪ V_B,E) in which any vertex in V_A (res...
share
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...
research
∙
10/11/2021
Packing list-colourings
List colouring is an influential and classic topic in graph theory. We i...
research
∙
12/31/2019
