Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301)
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: Updating the complexity status of coloring graphs without a fixed induced linear forest |
scientific article; zbMATH DE number 6014295
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Updating the complexity status of coloring graphs without a fixed induced linear forest |
scientific article; zbMATH DE number 6014295 |
Statements
Updating the complexity status of coloring graphs without a fixed induced linear forest (English)
0 references
13 March 2012
0 references
graph coloring
0 references
forbidden induced subgraph
0 references
linear forest
0 references
0 references
0.9245283
0 references
0.89596665
0 references
0.88674206
0 references
0.87043554
0 references
0.8669476
0 references
0.8669476
0 references
0.8633475
0 references
0.86257845
0 references
0.86257845
0 references
