{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T15:10:08Z","timestamp":1704208208851},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"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":7351,"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":[[1993,6]]},"DOI":"10.1016\/0166-218x(93)90111-z","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"185-195","source":"Crossref","is-referenced-by-count":2,"title":["On certain Hamiltonian inner triangulations"],"prefix":"10.1016","volume":"43","author":[{"given":"Robert J.","family":"Cimikowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90111-Z_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0166-218X(93)90111-Z_BIB2","first-page":"265","article-title":"Approximation algorithms for NP-complete problems on planar graphs","author":"Baker","year":"1983","journal-title":"Proceedings IEEE Foundation of Computer Science Conference"},{"key":"10.1016\/0166-218X(93)90111-Z_BIB3","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0196-6774(89)90012-6","article-title":"The Hamilton cycle problem is linear-time solvable for 4-connected planar graphs","volume":"10","author":"Chiba","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(93)90111-Z_BIB4","series-title":"The Traveling Salesman Problem","first-page":"403","article-title":"Hamiltonian cycles","author":"Chv\u00e1tal","year":"1985"},{"key":"10.1016\/0166-218X(93)90111-Z_BIB5","first-page":"793","article-title":"Sur la sph\u00e8re vide","volume":"6","author":"Delaunay","year":"1934","journal-title":"Izv. Akad. Nauk SSSR"},{"key":"10.1016\/0166-218X(93)90111-Z_BIB6","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0020-0190(87)90124-4","article-title":"A nonhamiltonian, nondegenerate Delaunay triangulation","volume":"25","author":"Dillencourt","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(93)90111-Z_BIB7","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1145\/41958.41978","article-title":"Toughness and Delaunay triangulations","author":"Dillencourt","year":"1987","journal-title":"Proceedings of the Third ACM Symposium on Computational Geometry, Waterloo, Ont."},{"key":"10.1016\/0166-218X(93)90111-Z_BIB8","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0095-8956(89)90008-7","article-title":"An upper bound on the shortness exponent of inscribable graphs","volume":"46","author":"Dillencourt","year":"1989","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(93)90111-Z_BIB9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/jgt.3190140105","article-title":"Hamiltonian cycles in planar triangulations with no separating triangles","volume":"14","author":"Dillencourt","year":"1990","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(93)90111-Z_BIB10","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(93)90111-Z_BIB11","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0166-218X(93)90111-Z_BIB12","series-title":"Algorithms and Complexity","first-page":"1","article-title":"The probabilistic analysis of some combinatorial search problems","author":"Karp","year":"1976"},{"key":"10.1016\/0166-218X(93)90111-Z_BIB13","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1111\/j.1538-4632.1980.tb00031.x","article-title":"Properties of Gabriel graphs relevant to geographic variation research and the clustering of points in the plane","volume":"3","author":"Matula","year":"1980","journal-title":"Geog. Analysis"},{"key":"10.1016\/0166-218X(93)90111-Z_BIB14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(78)90051-8","article-title":"Finding the intersection of two convex polyhedra","volume":"7","author":"Muller","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(93)90111-Z_BIB15","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0146-664X(74)80004-3","article-title":"Computing the perceptual boundaries of dot patterns","volume":"3","author":"O'Callaghan","year":"1974","journal-title":"Comput. Graph. Image Process."},{"key":"10.1016\/0166-218X(93)90111-Z_BIB16","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","article-title":"Hamiltonian circuits in random graphs","volume":"14","author":"P\u00f3sa","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(93)90111-Z_BIB17","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0166-218X(93)90111-Z_BIB18","first-page":"14","article-title":"The Dirichlet Tessellation as an aid in data analysis","volume":"7","author":"Sibson","year":"1980","journal-title":"Scand. J. Statist."},{"key":"10.1016\/0166-218X(93)90111-Z_BIB19","first-page":"1324","article-title":"Pattern recognition and geometrical complexity","author":"Toussaint","year":"1980","journal-title":"Fifth International Conference on Pattern Recognition, Miami Beach"},{"key":"10.1016\/0166-218X(93)90111-Z_BIB20","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0167-8655(83)90070-3","article-title":"Some properties of the planar euclidean relative neighborhood graph","volume":"1","author":"Urquhart","year":"1983","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/0166-218X(93)90111-Z_BIB21","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."},{"key":"10.1016\/0166-218X(93)90111-Z_BIB22","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","article-title":"Nonseparable and planar graphs","volume":"34","author":"Whitney","year":"1932","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0166-218X(93)90111-Z_BIB23","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","article-title":"Embedding planar graphs in four pages","volume":"1","author":"Yannakakis","year":"1989","journal-title":"J. Comput. System Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390111Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390111Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T14:57:56Z","timestamp":1704207476000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390111Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["0166218X9390111Z"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90111-z","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}