Two complexity results for the vertex coloring problem (Q505438)
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 complexity results for the vertex coloring problem |
scientific article; zbMATH DE number 6676771
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two complexity results for the vertex coloring problem |
scientific article; zbMATH DE number 6676771 |
Statements
Two complexity results for the vertex coloring problem (English)
0 references
23 January 2017
0 references
computational complexity
0 references
coloring problem
0 references
hereditary class
0 references
polynomial-time algorithm
0 references
0 references
0 references
