"Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs."

Shenwei Huang, Matthew Johnson, Daniël Paulusma (2014)

> Home

Details and statistics

DOI: 10.1007/978-3-319-07956-1_15

access: closed

type: Conference or Workshop Paper

metadata version: 2020-09-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/aaim/Huang0P14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaim/Huang0P14
Shenwei Huang, Matthew Johnson, Daniël Paulusma:
Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs. AAIM 2014: 162-173

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.