{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:05Z","timestamp":1725662825971},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540107040"},{"type":"electronic","value":"9783540386612"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10704-5_16","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:14:25Z","timestamp":1330190065000},"page":"182-195","source":"Crossref","is-referenced-by-count":1,"title":["An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph"],"prefix":"10.1007","author":[{"given":"T.","family":"Asano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Kikuchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Saito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"16_CR1","unstructured":"A. V. Aho, J. E. Hoperoft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974."},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BFb0121193","volume":"8","author":"R. E. Bixby","year":"1978","unstructured":"R. E. Bixby and D. Wang, An algorithm for finding hamiltonian circuits in certain graphs, Mathematical Programming Study, 8(1978), pp. 35\u201349.","journal-title":"Mathematical Programming Study"},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(76)90078-9","volume":"15","author":"J. A. Bondy","year":"1976","unstructured":"J. A. Bondy and V. Chv\u00e1tal, A method in graph theory, Discrete Math., 15(1976), pp. 111\u2013135.","journal-title":"Discrete Math."},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M. R. Garey","year":"1976","unstructured":"M. R. Garey, D. S. Johnson and R. E. Tarjan, The planar Hamiltonian circuit problem is NP-complete, SIAM J. Comput., 5(1976), pp. 704\u2013714.","journal-title":"SIAM J. Comput."},{"key":"16_CR5","unstructured":"D. Gouyou-Beauchamps, Un algorithme de recherche de circuit Hamiltonien dans les graphes 4-connexes planaries, Colloques Internationaux CNRS, No. 260 \u2014 Probl\u00e9ms Combinatoires et Theorie des Graphes, ed, J.C. Bermond, J.C. Fournier, M. Las Vergnas and D. Scotteau, (1978), pp. 185\u2013187."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"F. Harary, Graph Theory, Addison-Welsey, Reading, Mass., 1969.","DOI":"10.21236\/AD0705364"},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. E. Hopcroft","year":"1974","unstructured":"J. E. Hopcroft and R. E. Tarjan, Efficient planarity testing, J. Assoc. Comput. Mach., 21(1974), pp. 549\u2013568.","journal-title":"J. Assoc. Comput. Mach."},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"R. M. Karp, Reducibility among combinatorial problems, in: R. E. Miller and J. W. Thatcher, eds, Complexity of Computer Computations, Plenum Press, New York, (1972) pp. 85\u2013104."},{"key":"16_CR9","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1090\/S0002-9947-1956-0081471-8","volume":"82","author":"W. T. Tutte","year":"1956","unstructured":"W. T. Tutte, A theorem on planar graphs, Trans. Amer. Math. Soc., 82(1956), pp. 99\u2013116.","journal-title":"Trans. Amer. Math. Soc."},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"378","DOI":"10.2307\/1968197","volume":"32","author":"H. Whitney","year":"1931","unstructured":"H. Whitney, A theorem on graphs, Annals Math., 32(1931), pp. 378\u2013390.","journal-title":"Annals Math."}],"container-title":["Lecture Notes in Computer Science","Graph Theory and Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10704-5_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:38:47Z","timestamp":1619555927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10704-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540107040","9783540386612"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-10704-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}