Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
- 1 January 1980
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 30 (3) , 289-293
- https://doi.org/10.1016/0012-365x(80)90236-8
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Planar 3-colorability is polynomial completeACM SIGACT News, 1973