{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:30:31Z","timestamp":1760819431290},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,2,1]],"date-time":"1983-02-01T00:00:00Z","timestamp":412905600000},"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":11124,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1983,2]]},"DOI":"10.1016\/0166-218x(83)90042-2","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T12:43:22Z","timestamp":1034340202000},"page":"211-222","source":"Crossref","is-referenced-by-count":21,"title":["An approximation algorithm for the hamiltonian walk problem on maximal planar graphs"],"prefix":"10.1016","volume":"5","author":[{"given":"Takao","family":"Nishizeki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takao","family":"Asano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takahiro","family":"Watanabe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(83)90042-2_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0166-218X(83)90042-2_BIB2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/jgt.3190040310","article-title":"An upper bound on the length of a hamiltonian walk of a maximal planar graph","volume":"4","author":"Asano","year":"1980","journal-title":"J. of Graph Theory"},{"key":"10.1016\/0166-218X(83)90042-2_BIB3","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/S0021-9800(70)80054-0","article-title":"Hamiltonian circuits on 3-polytopes","volume":"2","author":"Barnette","year":"1970","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0166-218X(83)90042-2_BIB4","article-title":"Worst-case analysis of a new heuristic for the traveling salesman problem","volume":"388","author":"Christofides","year":"1976"},{"key":"10.1016\/0166-218X(83)90042-2_BIB5","series-title":"Algorithms and Complexity: Recent Results and New Directions","first-page":"41","article-title":"Approximation algorithm for combinatorial problems: An annoted bibiography","author":"Garey","year":"1976"},{"key":"10.1016\/0166-218X(83)90042-2_BIB6","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\/0166-218X(83)90042-2_BIB7","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0203017","article-title":"On Hamiltonian walk in graphs","volume":"3","author":"Goodman","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(83)90042-2_BIB8","first-page":"185","article-title":"Un algorithme de recherche de circuit Hamiltonien dans les graphes 4-connexes planaires","author":"Gouyou-Beauchamps","year":"1978","journal-title":"Colloques Internationaux CNRS"},{"key":"10.1016\/0166-218X(83)90042-2_BIB9","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0166-218X(83)90042-2_BIB10","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0166-218X(83)90042-2_BIB11","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\/0166-218X(83)90042-2_BIB12","doi-asserted-by":"crossref","first-page":"378","DOI":"10.2307\/1968197","article-title":"A theorem on graphs","volume":"32","author":"Whitney","year":"1931","journal-title":"Annals Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X83900422?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X83900422?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T06:51:15Z","timestamp":1554965475000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X83900422"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,2]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,2]]}},"alternative-id":["0166218X83900422"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(83)90042-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1983,2]]}}}