"Narrowing the Complexity Gap for Colouring (Cs, ..."

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

> Home

Details and statistics

DOI: 10.1093/COMJNL/BXV039

access: closed

type: Journal Article

metadata version: 2020-10-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cj/Huang0P15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cj/Huang0P15
Shenwei Huang, Matthew Johnson, Daniël Paulusma:
Narrowing the Complexity Gap for Colouring (C_s, P_t)-Free Graphs. Comput. J. 58(11): 3074-3088 (2015)

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.