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

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]

Abstract

Abstract is missing.