Reconfiguring Graph Homomorphisms on the Sphere

Jae-Baek Lee, Jonathan A. Noel, Mark Siggers

Given a loop-free graph $H$, the reconfiguration problem for homomorphisms to $H$ (also called $H$-colourings) asks: given two $H$-colourings $f$ of $g$ of a graph $G$, is it possi…