The reconfiguration graph for the k-colourings of a graph G, denoted
R_k...
For a graph G, the k-recolouring graph ℛ_k(G) is the graph
whose vertice...
The diamond is the graph obtained by removing an edge from the complete ...
Given two n-vertex polygons, P=(p_1, …, p_n) lying in the xy-plane
at z=...
A k-colouring of a graph G is an assignment of at most k colours to the
...
Given two graphs H_1 and H_2, a graph G is (H_1,H_2)-free if it
contains...