"Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover."

Jirí Fiala, Petr A. Golovach, Jan Kratochvíl (2009)

> Home

Details and statistics

DOI: 10.1007/978-3-642-02017-9_25

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/tamc/FialaGK09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tamc/FialaGK09
Jirí Fiala, Petr A. Golovach, Jan Kratochvíl:
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. TAMC 2009: 221-230

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.