"A graph theoretic proof of the complexity of colouring by a local ..."

Gary MacGillivray, Jacobus Swarts, Jørgen Bang-Jensen (2011)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition @ ucalgary.ca (open access)
- export record
  dblp key:
  - journals/cdm/MacGillivraySB11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cdm/MacGillivraySB11
Gary MacGillivray, Jacobus Swarts, Jørgen Bang-Jensen:
A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles. Contributions Discret. Math. 6(2) (2011)

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.