Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover (Q3630207)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover |
scientific article |
Statements
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover (English)
0 references
3 June 2009
0 references
