A Dichotomy Theorem for Circular Colouring Reconfiguration

Richard C. Brewster, Sean McGuinness, Benjamin Moore +1

The "reconfiguration problem" for circular colourings asks, given two $(p,q)$-colourings $f$ and $g$ of a graph $G$, is it possible to transform $f$ into $g$ by changing the colour…