Recolouring reflexive digraphs

We show that for a reflexive digraph cycle H and a reflexive digraph G, the problem of determining whether there is a path between two maps in Col(G,H) can be solved in time polynomial in G. When G is not reflexive, we show the same except for certain digraph 4-cycles H.