Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete (Q1146685)
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: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete |
scientific article; zbMATH DE number 3700870
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete |
scientific article; zbMATH DE number 3700870 |
Statements
Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete (English)
0 references
1980
0 references
unique colorability
0 references
NP-complete
0 references
4-regular graph
0 references
