4 citations · 4 across the 1 of their papers we have counts for
1 paper
Richard C. Brewster, Jae-Baek Lee, Benjamin Moore +2
For a fixed graph H, the reconfiguration problem for H-colourings (i.e. homomorphisms to H) asks: given a graph G and two H-colourings φ and ψ of G, does there exis…