Two cases of polynomial-time solvability for the coloring problem (Q5963654)
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: Two cases of polynomial-time solvability for the coloring problem |
scientific article; zbMATH DE number 6544342
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two cases of polynomial-time solvability for the coloring problem |
scientific article; zbMATH DE number 6544342 |
Statements
Two cases of polynomial-time solvability for the coloring problem (English)
0 references
23 February 2016
0 references
vertex coloring
0 references
computational complexity
0 references
polynomial-time algorithm
0 references
0.8790404200553894
0 references
0.8702402114868164
0 references
0.8622139692306519
0 references
