Login / Signup
The 2-colouring problem for $(m, n)$-mixed graphs with switching is polynomial.
Richard C. Brewster
Arnott Kidner
Gary MacGillivray
Published in:
Discret. Math. Theor. Comput. Sci. (2022)
Keyphrases
</>
graph mining
graph matching
graph databases
directed graph
database
graph structure
graph theoretic
series parallel
structured objects
bayesian networks
graph theory
undirected graph
graph structures
subgraph isomorphism
labeled graphs
tunnel diode