NP-completeness of a family of graph-colouring problems (Q1835680)
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: NP-completeness of a family of graph-colouring problems |
scientific article; zbMATH DE number 3794097
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-completeness of a family of graph-colouring problems |
scientific article; zbMATH DE number 3794097 |
Statements
NP-completeness of a family of graph-colouring problems (English)
0 references
1983
0 references
graph colourability
0 references
NP-complete
0 references
