On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:17, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the parameterized complexity of coloring graphs in the absence of a linear forest |
scientific article |
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
