Optimally Reconfiguring List and Correspondence Colourings

Stijn Cambie, Wouter Cames van Batenburg, Daniel W. Cranston

The reconfiguration graph ${\mathcal{C}}_k(G)$ for the $k$-colourings of a graph $G$ has a vertex for each proper $k$-colouring of $G$, and two vertices of ${\mathcal{C}}_k(G)$ are adj…