Two cases of polynomial-time solvability for the coloring problem (Q5963654): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:31, 30 January 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
