{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:52:05Z","timestamp":1761807125798},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1016\/0196-6774(89)90012-6","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"187-211","source":"Crossref","is-referenced-by-count":63,"title":["The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs"],"prefix":"10.1016","volume":"10","author":[{"given":"Norishige","family":"Chiba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(89)90012-6_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(84)90109-4","article-title":"A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs","volume":"7","author":"Asano","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0196-6774(89)90012-6_BIB2","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1002\/jgt.3190100404","article-title":"A theorem on paths in planar graphs","volume":"10","author":"Chiba","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/0196-6774(89)90012-6_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\/0196-6774(89)90012-6_BIB4","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1137\/0211042","article-title":"The Hamiltonian circuit problem is polynomial for 4-connected planar graphs","volume":"11","author":"Gouyou-Beauchamps","year":"1982","journal-title":"SIAM J. Comput."},{"issue":"No. 3","key":"10.1016\/0196-6774(89)90012-6_BIB5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","article-title":"Dividing a graph into triconnected components","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(89)90012-6_BIB6","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"year":"1967","author":"Ore","series-title":"The Four Color Problem","key":"10.1016\/0196-6774(89)90012-6_BIB7"},{"key":"10.1016\/0196-6774(89)90012-6_BIB8","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1002\/jgt.3190070205","article-title":"A theorem on paths in planar graphs","volume":"7","author":"Thomassen","year":"1983","journal-title":"J. Graph Theory"},{"key":"10.1016\/0196-6774(89)90012-6_BIB9","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1090\/S0002-9947-1956-0081471-8","article-title":"A theorem on planar graphs","volume":"82","author":"Tutte","year":"1956","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0196-6774(89)90012-6_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01837870","article-title":"Bridges and Hamiltonian circuits in planar graphs","volume":"15","author":"Tutte","year":"1977","journal-title":"Aequations Math."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677489900126?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677489900126?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:54:47Z","timestamp":1548744887000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677489900126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["0196677489900126"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(89)90012-6","relation":{},"ISSN":["0196-6774"],"issn-type":[{"type":"print","value":"0196-6774"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}