Complexity of coloring graphs without paths and cycles (Q344861)
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: Complexity of coloring graphs without paths and cycles |
scientific article; zbMATH DE number 6656019
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of coloring graphs without paths and cycles |
scientific article; zbMATH DE number 6656019 |
Statements
Complexity of coloring graphs without paths and cycles (English)
0 references
24 November 2016
0 references
coloring
0 references
certifying algorithms
0 references
paths
0 references
cycles
0 references
NP-completeness
0 references
obstructions
0 references
0 references
0 references
