{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:46:22Z","timestamp":1740109582059,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,5,19]],"date-time":"2021-05-19T00:00:00Z","timestamp":1621382400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,19]],"date-time":"2021-05-19T00:00:00Z","timestamp":1621382400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s00454-021-00296-2","type":"journal-article","created":{"date-parts":[[2021,5,19]],"date-time":"2021-05-19T14:02:46Z","timestamp":1621432966000},"page":"12-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Taking a Detour; or, Gioan\u2019s Theorem, and Pseudolinear Drawings of Complete Graphs"],"prefix":"10.1007","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7005-8599","authenticated-orcid":false,"given":"Marcus","family":"Schaefer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,19]]},"reference":[{"key":"296_CR1","unstructured":"Aichholzer, O., Hackl, T., Pilz, A., Salazar, G., Vogtenhuber, B.: Deciding monotonicity of good drawings of the complete graph. In: 16th Spanish Meeting on Computational Geometry (Barcelona 2015), booklet of abstracts, pp. 33\u201336. http:\/\/dccg.upc.edu\/egc15\/en\/program\/"},{"issue":"4","key":"296_CR2","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1002\/jgt.22167","volume":"87","author":"A Arroyo","year":"2018","unstructured":"Arroyo, A., McQuillan, D., Richter, R.B., Salazar, G.: Levi\u2019s lemma, pseudolinear drawings of $K_n$, and empty triangles. J. Graph Theory 87(4), 443\u2013459 (2018)","journal-title":"J. Graph Theory"},{"key":"296_CR3","doi-asserted-by":"crossref","unstructured":"Balko, M., Fulek, R., Kyn\u010dl, J.: Crossing numbers and combinatorial characterization of monotone drawings of\u00a0$K_n$ (2013).arXiv:1312.3679","DOI":"10.1007\/s00454-014-9644-z"},{"issue":"1","key":"296_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s00454-014-9644-z","volume":"53","author":"M Balko","year":"2015","unstructured":"Balko, M., Fulek, R., Kyn\u010dl, J.: Crossing numbers and combinatorial characterization of monotone drawings of $K_n$. Discrete Comput. Geom. 53(1), 107\u2013143 (2015)","journal-title":"Discrete Comput. Geom."},{"key":"296_CR5","first-page":"322","volume":"75","author":"G Cairns","year":"2019","unstructured":"Cairns, G., Groves, E., Nikolayevsky, Y.: Bad drawings of small complete graphs. Australas. J. Combin. 75, 322\u2013342 (2019)","journal-title":"Australas. J. Combin."},{"key":"296_CR6","unstructured":"Eggleton, R.B.: Crossing Numbers of Graphs. PhD thesis, University of Calgary (1973)"},{"key":"296_CR7","doi-asserted-by":"crossref","unstructured":"Gioan, E.: Complete graph drawings up to triangle mutations. In: Graph-Theoretic Concepts in Computer Science (Metz 2005). Lecture Notes in Computer Science, vol. 3787, pp. 139\u2013150. Springer, Berlin (2005)","DOI":"10.1007\/11604686_13"},{"issue":"1","key":"296_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0012-365X(80)90096-5","volume":"32","author":"JE Goodman","year":"1980","unstructured":"Goodman, J.E.: Proof of a conjecture of Burr, Gr\u00fcnbaum, and Sloane. Discrete Math. 32(1), 27\u201335 (1980)","journal-title":"Discrete Math."},{"key":"296_CR9","unstructured":"Gronau, H.-D.O.F., Harborth, H.: Numbers of nonisomorphic drawings for small graphs. In: 20th Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton 1989). Congress Numerical, vol.\u00a071, pp. 105\u2013114. Charles Babbage Research Centre, Winnipeg (1990)"},{"issue":"1\u20132","key":"296_CR10","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/BF02772960","volume":"51","author":"J Hass","year":"1985","unstructured":"Hass, J., Scott, P.: Intersections of curves on surfaces. Israel J. Math. 51(1\u20132), 90\u2013120 (1985)","journal-title":"Israel J. Math."},{"issue":"7","key":"296_CR11","doi-asserted-by":"publisher","first-page":"1676","DOI":"10.1016\/j.ejc.2009.03.005","volume":"30","author":"J Kyn\u010dl","year":"2009","unstructured":"Kyn\u010dl, J.: Enumeration of simple complete topological graphs. Eur. J. Comb. 30(7), 1676\u20131685 (2009)","journal-title":"Eur. J. Comb."},{"issue":"3","key":"296_CR12","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s00454-010-9320-x","volume":"45","author":"J Kyn\u010dl","year":"2011","unstructured":"Kyn\u010dl, J.: Simple realizability of complete abstract topological graphs in P. Discrete Comput. Geom. 45(3), 383\u2013399 (2011)","journal-title":"Discrete Comput. Geom."},{"key":"296_CR13","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"B Mohar","year":"2001","unstructured":"Mohar, B., Thomassen, C.: Graphs on Surfaces. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore (2001)"},{"issue":"2","key":"296_CR14","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s00454-003-0012-9","volume":"30","author":"J Pach","year":"2003","unstructured":"Pach, J., Solymosi, J., T\u00f3th, G.: Unavoidable configurations in complete topological graphs. Discrete Comput. Geom. 30(2), 311\u2013320 (2003)","journal-title":"Discrete Comput. Geom."},{"issue":"5","key":"296_CR15","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s00493-006-0032-z","volume":"26","author":"J Pach","year":"2006","unstructured":"Pach, J., T\u00f3th, G.: How many ways can one draw a graph? Combinatorica 26(5), 559\u2013576 (2006)","journal-title":"Combinatorica"},{"key":"296_CR16","doi-asserted-by":"publisher","DOI":"10.1201\/9781315152394","volume-title":"Crossing Numbers of Graphs. Discrete Mathematics and its Applications.","author":"M Schaefer","year":"2018","unstructured":"Schaefer, M.: Crossing Numbers of Graphs. Discrete Mathematics and its Applications. CRC Press, Boca Raton (2018)"},{"key":"296_CR17","unstructured":"Schaefer, M.: A proof of Levi\u2019s extension lemma (2019).arXiv:1910.05388"},{"key":"296_CR18","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"WT Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. Lond. Math. Soc. 13, 743\u2013767 (1963)","journal-title":"Proc. Lond. Math. Soc."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-021-00296-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-021-00296-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-021-00296-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,3]],"date-time":"2023-11-03T22:43:54Z","timestamp":1699051434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-021-00296-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,19]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["296"],"URL":"https:\/\/doi.org\/10.1007\/s00454-021-00296-2","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2021,5,19]]},"assertion":[{"value":"16 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}