The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial (Q6045448)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial |
scientific article; zbMATH DE number 7689917
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial |
scientific article; zbMATH DE number 7689917 |
Statements
The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial (English)
0 references
31 May 2023
0 references
graph colouring
0 references
edge-coloured homomorphism
0 references
reconfiguration
0 references
switching
0 references
