A dichotomy theorem for $\Gamma$-switchable $H$-colouring on $m$-edge coloured graphs

Richard Brewster, Arnott Kidner, Gary MacGillivray

Let $G$ be a graph in which each edge is assigned one of the colours $1,2,\dots ,m$, and let $\Gamma$ be a subgroup of $S_m$. The operation of switching at a vertex $x$ of $G$ with r…