{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T22:24:38Z","timestamp":1770071078349,"version":"3.49.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1990,3]]},"DOI":"10.1016\/0020-0190(90)90142-k","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"87-96","source":"Crossref","is-referenced-by-count":8,"title":["Connectivity of plane triangulations"],"prefix":"10.1016","volume":"34","author":[{"given":"Jean-Paul","family":"Laumond","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0190(90)90142-K_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."},{"issue":"1","key":"10.1016\/0020-0190(90)90142-K_BIB2","doi-asserted-by":"crossref","DOI":"10.1137\/0214017","article-title":"Arboricity and subgraph listing algorithms","volume":"14","author":"Chiba","year":"1985","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/0020-0190(90)90142-K_BIB3","doi-asserted-by":"crossref","DOI":"10.1016\/0196-6774(89)90012-6","article-title":"The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs","volume":"10","author":"Chiba","year":"1989","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/0020-0190(90)90142-K_BIB4","doi-asserted-by":"crossref","DOI":"10.1007\/BF00264230","article-title":"Drawing planar graphs nicely","volume":"22","author":"Chiba","year":"1985","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(90)90142-K_BIB5","series-title":"The Traveling Salesman Problem","article-title":"Hamiltonian cycles","author":"Chv\u00e1tal","year":"1985"},{"key":"10.1016\/0020-0190(90)90142-K_BIB6","doi-asserted-by":"crossref","unstructured":"H. Crapo and J.P. Laumond, Hamiltonian cycles in Delaunay complexes, in: Boissonnat and Laumond, eds., Geometry and Robotics, Report INRIA\/LAAS; also in: Lecture Notes in Computer Sciences (Springer, Berlin, to appear).","DOI":"10.1007\/3-540-51683-2_36"},{"key":"10.1016\/0020-0190(90)90142-K_BIB7","article-title":"A graph based approach to object recognition","author":"De Floriani","year":"1987","journal-title":"Proc. 3rd ACM Symp. on Computational Geometry"},{"key":"10.1016\/0020-0190(90)90142-K_BIB8","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0020-0190(87)90124-4","article-title":"A non-hamiltonian, nondegenerate Delaunay triangulation","volume":"25","author":"Dillencourt","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(90)90142-K_BIB9","series-title":"Tech. Rep. CS-TR-2136","article-title":"Hamiltonian cycles in planar triangulations with no separating triangles","author":"Dillencourt","year":"1988"},{"issue":"1","key":"10.1016\/0020-0190(90)90142-K_BIB10","doi-asserted-by":"crossref","DOI":"10.1016\/0095-8956(89)90008-7","article-title":"An upper bound on the shortness exponent of inscrable polytopes","volume":"46","author":"Dillencourt","year":"1989","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0020-0190(90)90142-K_BIB11","first-page":"229","article-title":"On straight line representations of planar graphs","volume":"11","author":"Fary","year":"1948","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"10.1016\/0020-0190(90)90142-K_BIB12","series-title":"Thesis 79-23","article-title":"Connectivit\u00e9 des graphes et automorphismes de cartes: propri\u00e9t\u00e9s et algorithmes","author":"Fontet","year":"1979"},{"issue":"4","key":"10.1016\/0020-0190(90)90142-K_BIB13","doi-asserted-by":"crossref","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."},{"issue":"3","key":"10.1016\/0020-0190(90)90142-K_BIB14","doi-asserted-by":"crossref","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."},{"key":"10.1016\/0020-0190(90)90142-K_BIB15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-2001-2_13","article-title":"Isomorphism of planar graph","author":"Hopcroft","year":"1972","journal-title":"Complexity of Computer Computation"},{"issue":"3","key":"10.1016\/0020-0190(90)90142-K_BIB16","doi-asserted-by":"crossref","DOI":"10.1137\/0202012","article-title":"Dividing a graph into triconnected components","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/0020-0190(90)90142-K_BIB17","doi-asserted-by":"crossref","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(90)90142-K_BIB18","article-title":"Quasitriangular graphs: drawing planar graphs with straight line segments","author":"Laumond","year":"1985","journal-title":"Tech. Rep. LAAS\/CNRS 85011"},{"key":"10.1016\/0020-0190(90)90142-K_BIB19","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0020-0190(85)90055-9","article-title":"Enumeration of articulation pairs of a planar graph","volume":"21","author":"Laumond","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(90)90142-K_BIB20_1","article-title":"A learning system for the understanding of a mobile robot environment","author":"Laumond","year":"1986","journal-title":"European Working Session on Learning"},{"key":"10.1016\/0020-0190(90)90142-K_BIB20_2","series-title":"Machine and Human Learning","article-title":"A learning system for the understanding of a mobile robot environment","author":"Laumond","year":"1989"},{"key":"10.1016\/0020-0190(90)90142-K_BIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01837870","article-title":"Bridges and hamiltonians circuits in planar graphs","volume":"15","author":"Tutte","year":"1977","journal-title":"Aequations Math."},{"key":"10.1016\/0020-0190(90)90142-K_BIB22","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":"Ann. of Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090142K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090142K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:58:41Z","timestamp":1555088321000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909090142K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["002001909090142K"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90142-k","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}