{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T21:05:42Z","timestamp":1774127142394,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1979,4,1]],"date-time":"1979-04-01T00:00:00Z","timestamp":291772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1979,4]]},"DOI":"10.1016\/0020-0190(79)90023-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:20:15Z","timestamp":1027657215000},"page":"199-201","source":"Crossref","is-referenced-by-count":79,"title":["The np-completeness of the hamiltonian cycle problem in planar diagraphs with degree bound two"],"prefix":"10.1016","volume":"8","author":[{"given":"J.","family":"Plesn\u00b4ik","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(79)90023-1_bib1","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1145\/322003.322005","article-title":"Covering the points of a digraph with point-disjoint paths and its application to code optimization","volume":"24","author":"Boesch","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(79)90023-1_bib2","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":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(79)90023-1_bib3","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","article-title":"The planar hamiltonian circuit problem is NP-complete","volume":"5","author":"Garey","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(79)90023-1_bib4","series-title":"Graph theory","author":"Harary","year":"1969"},{"key":"10.1016\/0020-0190(79)90023-1_bib5","series-title":"Complexity of computer computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0020-0190(79)90023-1_bib6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01920260","article-title":"Reduktion von Pra\u00a8zedenzstrukturen","volume":"20","author":"Noltemeier","year":"1976","journal-title":"Z. Operations Res."},{"key":"10.1016\/0020-0190(79)90023-1_bib7","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1137\/0203021","article-title":"Computationally related problems","volume":"3","author":"Sahni","year":"1974","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900231?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900231?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:51:37Z","timestamp":1555073497000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019079900231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,4]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1979,4]]}},"alternative-id":["0020019079900231"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(79)90023-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1979,4]]}}}