The 2-colouring problem for (m,n)-mixed graphs with switching is polynomial. - Richard C. Brewster; Arnott Kidner; Gary MacGillivray (Discret. Math. Theor. Comput. Sci., 2022)

A dichotomy theorem for Γ-switchable H-colouring on m-edge coloured graphs. - Richard C. Brewster; Arnott Kidner; Gary MacGillivray (CoRR, 2023)