"Closing Complexity Gaps for Coloring Problems on H-Free Graphs."

Petr A. Golovach, Daniël Paulusma, Jian Song (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-35261-4_5

access: closed

type: Conference or Workshop Paper

metadata version: 2021-02-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/GolovachPS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/GolovachPS12
Petr A. Golovach, Daniël Paulusma, Jian Song:
Closing Complexity Gaps for Coloring Problems on H-Free Graphs. ISAAC 2012: 14-23

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.