{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:51Z","timestamp":1759063671150},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1987,12]]},"DOI":"10.1007\/bf02187887","type":"journal-article","created":{"date-parts":[[2005,10,29]],"date-time":"2005-10-29T08:51:54Z","timestamp":1130575914000},"page":"327-343","source":"Crossref","is-referenced-by-count":11,"title":["A lower bound for the optimal crossing-free Hamiltonian cycle problem"],"prefix":"10.1007","volume":"2","author":[{"given":"Ryan B.","family":"Hayward","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1987,12,1]]},"reference":[{"key":"BF02187887_CR1","first-page":"7","volume":"7","author":"S. Akl","year":"1979","unstructured":"S. Akl, A lower bound on the maximum number of crossing-free Hamilton cycles in a rectilinear drawing ofK n ,Ars Combin. 7 (1979), 7\u201318.","journal-title":"Ars Combin."},{"key":"BF02187887_CR2","first-page":"9","volume":"12","author":"M. Ajtai","year":"1982","unstructured":"M. Ajtai, V. Chv\u00e1tal, M. Newborn, and E. Szemer\u00e9di, Crossing-free subgraphs,Ann. Discrete Math. 12 (1982), 9\u201312.","journal-title":"Ann. Discrete Math."},{"key":"BF02187887_CR3","doi-asserted-by":"crossref","first-page":"52","DOI":"10.2307\/2319261","volume":"80","author":"P. Erdos","year":"1973","unstructured":"P. Erdos and R. K. Guy, Crossing number problems,Amer. Math. Monthly 80 (1973), 52\u201358.","journal-title":"Amer. Math. Monthly"},{"key":"BF02187887_CR4","first-page":"757","volume":"88","author":"R. K. Guy","year":"1981","unstructured":"R. K. Guy, Unsolved problems,Amer. Math. Monthly 88 (1981), 757.","journal-title":"Amer. Math. Monthly"},{"key":"BF02187887_CR5","volume-title":"The Optimal Crossing-Free Hamilton Cycle Problem for Planar Drawings of the Complete Graph","author":"R. B. Hayward","year":"1982","unstructured":"R. B. Hayward, The Optimal Crossing-Free Hamilton Cycle Problem for Planar Drawings of the Complete Graph, M.Sc. thesis, Queen's University, Kingston, Ontario, 1982."},{"key":"BF02187887_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0095-8956(80)90041-6","volume":"29","author":"M. Newborn","year":"1980","unstructured":"M. Newborn and W. O. J. Moser, Optimal crossing-free Hamiltonian circuit drawings ofK n ,J. Combin. Theory Ser. B 29 (1980), 13\u201326.","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187887.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02187887\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187887","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T17:22:36Z","timestamp":1557854556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02187887"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["BF02187887"],"URL":"https:\/\/doi.org\/10.1007\/bf02187887","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}