%0 Journal Article
%A Brewster, Richard C
%A Kidner, Arnott
%A MacGillivray, Gary
%T The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial
%J Discrete mathematics & theoretical computer science
%D 2022
%V 24
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.9242/
%R 10.46298/dmtcs.9242
%G en
%F DMTCS_2022_24_2_a5