On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the parameterized complexity of coloring graphs in the absence of a linear forest |
scientific article; zbMATH DE number 6082063
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the parameterized complexity of coloring graphs in the absence of a linear forest |
scientific article; zbMATH DE number 6082063 |
Statements
On the parameterized complexity of coloring graphs in the absence of a linear forest (English)
0 references
13 September 2012
0 references
\(k\)-coloring
0 references
list \(k\)-coloring
0 references
\(H\)-free
0 references
linear forest
0 references
fixed-parameter tractable
0 references
0 references
0 references
