Richard C. Brewster, Arnott Kidner, Gary MacGillivray. The 2-colouring problem for $(m, n)$-mixed graphs with switching is polynomial. Discrete Mathematics & Theoretical Computer Science, 24(2), 2022. [doi]
@article{BrewsterKM22,
title = {The 2-colouring problem for $(m, n)$-mixed graphs with switching is polynomial},
author = {Richard C. Brewster and Arnott Kidner and Gary MacGillivray},
year = {2022},
doi = {10.46298/dmtcs.9242},
url = {https://doi.org/10.46298/dmtcs.9242},
researchr = {https://researchr.org/publication/BrewsterKM22},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics & Theoretical Computer Science},
volume = {24},
number = {2},
}