Complexity of coloring graphs without paths and cycles (Q5405071)
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: Complexity of coloring graphs without paths and cycles |
scientific article; zbMATH DE number 6276037
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of coloring graphs without paths and cycles |
scientific article; zbMATH DE number 6276037 |
Statements
Complexity of Coloring Graphs without Paths and Cycles (English)
0 references
31 March 2014
0 references
0.9691783785820008
0 references
0.8929126262664795
0 references
0.8860146403312683
0 references
0.8628673553466797
0 references
0.8605552315711975
0 references
