Recolouring Homomorphisms to triangle-free reflexive graphs

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

For a graph $H$, the $H$-recolouring problem $\mathrm{Recol}(H)$ asks, for two given homomorphisms from a given graph $G$ to $H$, if one can get between them by a sequence of…