Recolouring planar graphs of girth at least five

Valentin Bartier, Nicolas Bousquet, Carl Feghali +3

For a positive integer $k$, the $k$-recolouring graph of a graph $G$ has as vertex set all proper $k$-colourings of $G$ with two $k$-colourings being adjacent if they differ by the…