"NP-completeness of a family of graph-colouring problems."

Robert W. Irving (1983)

> Home

Details and statistics

DOI: 10.1016/0166-218X(83)90020-3

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/Irving83
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Irving83
Robert W. Irving:
NP-completeness of a family of graph-colouring problems. Discret. Appl. Math. 5(1): 111-117 (1983)

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.