{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T07:20:44Z","timestamp":1762154444370,"version":"build-2065373602"},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10790,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","award":["YSE(A) 575215"],"award-info":[{"award-number":["YSE(A) 575215"]}],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1984,1]]},"DOI":"10.1016\/0166-218x(84)90109-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":17,"title":["A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs"],"prefix":"10.1016","volume":"7","author":[{"given":"Takao","family":"Asano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shunji","family":"Kikuchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nobuji","family":"Saito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1974","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","key":"10.1016\/0166-218X(84)90109-4_BIB1"},{"year":"1973","series-title":"Graphs and Hypergraphs","author":"Berge","key":"10.1016\/0166-218X(84)90109-4_BIB2"},{"key":"10.1016\/0166-218X(84)90109-4_BIB3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BFb0121193","article-title":"An algorithm for finding Hamiltonian circuits in certain graphs","volume":"8","author":"Bixby","year":"1978","journal-title":"Math. Programming Study"},{"key":"10.1016\/0166-218X(84)90109-4_BIB4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(76)90078-9","article-title":"A method in graph theory","volume":"15","author":"Bondy","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(84)90109-4_BIB5","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(84)90109-4_BIB6_1","series-title":"Colloques Internationaux CNRS, No. 260, Probl\u00e8ms Combinatoires et Theorie des Graphes","first-page":"185","article-title":"Un Algorithme de recherche de circuit Hamiltonian dans les graphes 4-connexes planaries","author":"Gouyou-Beauchamps","year":"1978"},{"key":"10.1016\/0166-218X(84)90109-4_BIB6_2","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."},{"year":"1969","series-title":"Graph Theory","author":"Harary","key":"10.1016\/0166-218X(84)90109-4_BIB7"},{"key":"10.1016\/0166-218X(84)90109-4_BIB8","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(84)90109-4_BIB9","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0166-218X(84)90109-4_BIB10","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(84)90109-4_BIB11","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:0166218X84901094?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X84901094?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T07:14:42Z","timestamp":1762154082000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X84901094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,1]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,1]]}},"alternative-id":["0166218X84901094"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(84)90109-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1984,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0166-218X(84)90109-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1984 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}