Two cases of polynomial-time solvability for the coloring problem (Q5963654): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-014-9792-3 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-014-9792-3 / rank | |||
Normal rank | |||
Latest revision as of 12:40, 9 December 2024
scientific article; zbMATH DE number 6544342
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
