{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T02:18:14Z","timestamp":1772504294971,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1980,1,1]],"date-time":"1980-01-01T00:00:00Z","timestamp":315532800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12251,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1980]]},"DOI":"10.1016\/0012-365x(80)90236-8","type":"journal-article","created":{"date-parts":[[2003,1,10]],"date-time":"2003-01-10T13:08:14Z","timestamp":1042204094000},"page":"289-293","source":"Crossref","is-referenced-by-count":103,"title":["Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete"],"prefix":"10.1016","volume":"30","author":[{"given":"David P.","family":"Dailey","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(80)90236-8_BIB1","article-title":"Graph coloring by humans and machines","author":"Dailey","year":"1978"},{"key":"10.1016\/0012-365X(80)90236-8_BIB2","series-title":"Proceedings, Third Annual ACM Computing Theory Symposium","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0012-365X(80)90236-8_BIB3","series-title":"Complexity of Computer Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0012-365X(80)90236-8_BIB4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0012-365X(80)90236-8_BIB5","series-title":"The design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0012-365X(80)90236-8_BIB6","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(80)90236-8_BIB7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1008293.1008294","article-title":"Planar 3-colorability is polynomial complete","author":"Stockmeyer","year":"1973","journal-title":"SIGACT News"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X80902368?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X80902368?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T09:22:59Z","timestamp":1553937779000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X80902368"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980]]}},"alternative-id":["0012365X80902368"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(80)90236-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1980]]}}}