The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial

Richard C Brewster, Arnott Kidner, Gary MacGillivray

A mixed graph is a set of vertices together with an edge set and an arc set. An $(m,n)$-mixed graph $G$ is a mixed graph whose edges are each assigned one of $m$ colours, and whose…