Login / Signup

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

Richard C. BrewsterArnott KidnerGary MacGillivray
Published in: Discret. Math. Theor. Comput. Sci. (2022)
Keyphrases