research
∙
08/02/2021
Mixing colourings in 2K_2-free graphs
The reconfiguration graph for the k-colourings of a graph G, denoted R_k...
share
research
∙
06/21/2021
Recolouring weakly chordal graphs and the complement of triangle-free graphs
For a graph G, the k-recolouring graph â„›_k(G) is the graph whose vertice...
research
∙
06/16/2021
Colouring graphs with no induced six-vertex path or diamond
The diamond is the graph obtained by removing an edge from the complete ...
research
∙
04/13/2020
Reconstructing a Polyhedron between Polygons in Parallel Slices
Given two n-vertex polygons, P=(p_1, …, p_n) lying in the xy-plane at z=...
research
∙
03/03/2020
Building a larger class of graphs for efficient reconfiguration of vertex colouring
A k-colouring of a graph G is an assignment of at most k colours to the ...
research
∙
09/03/2018
