On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6082063 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
\(k\)-coloring | |||
| Property / zbMATH Keywords: \(k\)-coloring / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
list \(k\)-coloring | |||
| Property / zbMATH Keywords: list \(k\)-coloring / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
\(H\)-free | |||
| Property / zbMATH Keywords: \(H\)-free / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
linear forest | |||
| Property / zbMATH Keywords: linear forest / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
fixed-parameter tractable | |||
| Property / zbMATH Keywords: fixed-parameter tractable / rank | |||
Normal rank | |||
Revision as of 10:14, 30 June 2023
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
