Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

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

Richard C. Brewster, Arnott Kidner, Gary MacGillivray (2022)

> Home

Details and statistics

DOI: 10.46298/DMTCS.9242

access: open

type: Journal Article

metadata version: 2023-06-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dmtcs/BrewsterKM22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmtcs/BrewsterKM22
Richard C. Brewster, Arnott Kidner, Gary MacGillivray:
The 2-colouring problem for (m,n)-mixed graphs with switching is polynomial. Discret. Math. Theor. Comput. Sci. 24(2) (2022)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.