{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T10:50:53Z","timestamp":1758279053417,"version":"3.41.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1023\/a:1021998507140","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T23:56:29Z","timestamp":1048290989000},"page":"79-86","source":"Crossref","is-referenced-by-count":10,"title":["Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian"],"prefix":"10.1007","volume":"7","author":[{"given":"Chiuyuan","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5113642_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(84)90109-4","volume":"7","author":"T. Asano","year":"1984","unstructured":"T. Asano, S. Kikuchi and N. Saito, \u201cA linear algorithm for finding hamiltonian cycles in 4-connected maximal planar graphs,\u201d Disc. Appl. Math., vol. 7, pp. 1-15, 1984.","journal-title":"Disc. Appl. Math."},{"key":"5113642_CR2","volume-title":"Graph and Digraphs","author":"G. Chartrand","year":"1981","unstructured":"G. Chartrand and L. Lensniak, Graph and Digraphs, Wadsworth: Monterey, CA, 1981."},{"key":"5113642_CR3","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0196-6774(89)90012-6","volume":"10","author":"N. Chiba","year":"1989","unstructured":"N. Chiba and T. Nishizeki, \u201cThe Hamilton cycle problem is linear-time solvable for 4-connected planar graphs,\u201d J. Algorithms, vol. 10, pp. 187-211, 1989.","journal-title":"J. Algorithms"},{"key":"5113642_CR4","first-page":"426","volume-title":"The Traveling Salesman Problem","author":"V. Chv\u00e1tal","year":"1985","unstructured":"V. Chv\u00e1tal, \u201cHamiltonian cycles,\u201d The Traveling Salesman Problem, John Wiley & Sons: NY, 1985, p. 426."},{"key":"5113642_CR5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/jgt.3190140105","volume":"14","author":"M.B. Dillencourt","year":"1990","unstructured":"M.B. Dillencourt, \u201cHamiltonian cycles in planar triangulations with no separating triangles,\u201d J. Graph Theory, vol. 14, pp. 31-49, 1990.","journal-title":"J. Graph Theory"},{"key":"5113642_CR6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1006\/jctb.1996.0008","volume":"66","author":"M.B. Dillencourt","year":"1996","unstructured":"M.B. Dillencourt, \u201cPolyhedra of small order and their hamiltonian properties,\u201d J. Comb. Theory, Series B, vol. 66, pp. 87-122, 1996.","journal-title":"J. Comb. Theory, Series B"},{"key":"5113642_CR7","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, \u201cThe planar Hamiltonian circuit problem is NP-complete,\u201d SIAM J. Comput., vol. 5, pp. 704-714, 1976.","journal-title":"SIAM J. Comput."},{"key":"5113642_CR8","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/jgt.3190020404","volume":"2","author":"S.L. Hakimi","year":"1978","unstructured":"S.L. Hakimi and E.F. Schmeichel, \u201cOn the connectivity of maximal planar graphs,\u201d J. Graph Theory, vol. 2, pp. 307-314, 1978.","journal-title":"J. Graph Theory"},{"key":"5113642_CR9","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(80)90240-X","volume":"30","author":"T. Nishizeki","year":"1980","unstructured":"T. Nishizeki, \u201cA 1-tought nonhamiltonian maximal planar graph,\u201d Disc. Math., vol. 30, pp. 305-307, 1980.","journal-title":"Disc. Math."},{"key":"5113642_CR10","first-page":"7","volume":"32","author":"T. Nishizeki","year":"1988","unstructured":"T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms, North-Holland Mathematics Studies 140, Annals of Discrete Mathematics, vol. 32, p. 7, 1988.","journal-title":"Planar Graphs: Theory and Algorithms"},{"key":"5113642_CR11","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, \u201cA theorem on planar graphs,\u201d Trans. Amer. Math. Soc., vol. 82, pp. 99-116, 1956.","journal-title":"Trans. Amer. Math. Soc."},{"key":"5113642_CR12","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"1996","unstructured":"D.B. West, Introduction to Graph Theory, Prentice Hall: Upper Saddle River, NJ, 1996."},{"key":"5113642_CR13","doi-asserted-by":"crossref","first-page":"378","DOI":"10.2307\/1968197","volume":"32","author":"H. Whitney","year":"1931","unstructured":"H. Whitney, \u201cA theorem on graphs,\u201d Ann. Math., vol. 32, pp. 378-390, 1931.","journal-title":"Ann. Math."},{"key":"5113642_CR14","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H. Whitney","year":"1932","unstructured":"H. Whitney, \u201cCongruent graphs and the connectivity of graphs,\u201d Amer. J. Math., vol. 54, pp. 150-168, 1932.","journal-title":"Amer. J. Math."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021998507140.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021998507140\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021998507140.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:10:55Z","timestamp":1751281855000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021998507140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["5113642"],"URL":"https:\/\/doi.org\/10.1023\/a:1021998507140","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}