Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete (Q1146685): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q55899212, #quickstatements; #temporary_batch_1705018876894 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:14, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete |
scientific article |
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
