Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486)
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: Improved complexity results on k-coloring P_t-free graphs |
scientific article; zbMATH DE number 6487478
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved complexity results on \(k\)-coloring \(P_t\)-free graphs |
scientific article; zbMATH DE number 6487478 |
Statements
Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (English)
0 references
30 September 2015
0 references
4-coloring
0 references
5-coloring
0 references
0 references
0.9750155806541444
0 references
0.9157387018203736
0 references
0.9094913005828856
0 references
0.906300127506256
0 references
0.9009408950805664
0 references
