{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:11Z","timestamp":1740107111881,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T00:00:00Z","timestamp":1659916800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T00:00:00Z","timestamp":1659916800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"PAPIIT","award":["IN108121"],"award-info":[{"award-number":["IN108121"]}]},{"name":"CONACyT","award":["A1-S-12891"],"award-info":[{"award-number":["A1-S-12891"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00373-022-02538-3","type":"journal-article","created":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T15:02:39Z","timestamp":1659970959000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Crossing Number of Twisted Graphs"],"prefix":"10.1007","volume":"38","author":[{"given":"Bernardo M.","family":"\u00c1brego","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2080-106X","authenticated-orcid":false,"given":"Silvia","family":"Fern\u00e1ndez-Merchant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana Paulina","family":"Figueroa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Jos\u00e9","family":"Montellano-Ballesteros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Rivera-Campo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,8]]},"reference":[{"key":"2538_CR1","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/s00454-014-9635-0","volume":"52\u20134","author":"BM \u00c1brego","year":"2014","unstructured":"\u00c1brego, B.M., Aichholzer, O., Fern\u00e1ndez-Merchant, S., Ramos, P., Salazar, G.: Shellable drawings and the cylindrical crossing number of $$K_n$$. Discrete Comput. Geom. 52\u20134, 743\u2013753 (2014). https:\/\/doi.org\/10.1007\/s00454-014-9635-0","journal-title":"Discrete Comput. Geom."},{"key":"2538_CR2","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/s00454-013-9514-0","volume":"49\u20134","author":"BM \u00c1brego","year":"2013","unstructured":"\u00c1brego, B.M., Aichholzer, O., Fern\u00e1ndez-Merchant, S., Ramos, P., Salazar, G.: The 2-page crossing number of $$K_n$$. Discrete Comput. Geom. 49\u20134, 747\u2013777 (2013). https:\/\/doi.org\/10.1007\/s00454-013-9514-0","journal-title":"Discrete Comput. Geom."},{"key":"2538_CR3","unstructured":"\u00c1brego, B.M., Aichholzer, O., Dandurand, J., Fern\u00e1ndez-Merchant, S., Lagoda, E., Sapozhnikov, Y.: Improved lower bounds on book crossing numbers of $$K_n$$. In: Proceedings JCDCG3, Tokyo University of Science (2016)"},{"key":"2538_CR4","unstructured":"\u00c1brego, B.M., Fern\u00e1ndez-Merchant, S.: The crossing lemma for convex graphs. Preprint"},{"key":"2538_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2019.101574","volume":"85","author":"E Ackerman","year":"2019","unstructured":"Ackerman, E.: On topological graphs with at most four crossings per edge. Comput. Geom. 85, 101574 (2019). https:\/\/doi.org\/10.1016\/j.comgeo.2019.101574","journal-title":"Comput. Geom."},{"key":"2538_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0304-0208(08)73484-4","volume":"12","author":"M Ajtai","year":"1982","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M., Szemer\u00e9di, A.: Crossing-free subgraphs. Ann. Discrete Math. 12, 9\u201312 (1982). https:\/\/doi.org\/10.1016\/S0304-0208(08)73484-4","journal-title":"Ann. Discrete Math."},{"key":"2538_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0608002","volume":"8\u20131","author":"FRK Chung","year":"1987","unstructured":"Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: Embedding graphs in books: a layout problem with applications to VLSI design. SIAM J. Algebraic Discrete Methods 8\u20131, 33\u201358 (1987). https:\/\/doi.org\/10.1137\/0608002","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"2538_CR8","first-page":"63","volume-title":"Proof Techniques in Graph Theory","author":"RK Guy","year":"1969","unstructured":"Guy, R.K.: The decline and fall of Zarankiewicz\u2019s theorem. In: Harary, F. (ed.) Proof Techniques in Graph Theory, pp. 63\u201369. Academic Press, New York (1969)"},{"key":"2538_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1017\/S0013091500025645","volume":"13\u20134","author":"F Harary","year":"1963","unstructured":"Harary, F., Hill, H.: On the number of crossings in a complete graph. Proc. Edinb. Math. Soc. 13\u20134, 333\u2013338 (1963). https:\/\/doi.org\/10.1017\/S0013091500025645","journal-title":"Proc. Edinb. Math. Soc."},{"key":"2538_CR10","unstructured":"Harborth, H., Mengersen, I.: Drawings of the complete graph with maximum number of crossings. In: Proceedings of the 23rd Southeastern International Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium, vol. 88, pp. 225\u2013228. Utilitas Mathematica, Winnipeg (1992)"},{"key":"2538_CR11","volume-title":"Complexity Issues in VLSI, Foundations of Computing Series","author":"T Leighton","year":"1983","unstructured":"Leighton, T.: Complexity Issues in VLSI, Foundations of Computing Series. MIT Press, Cambridge (1983)"},{"key":"2538_CR12","doi-asserted-by":"crossref","unstructured":"Oma\u00f1a-Pulido, E., Rivera-Campo, E.: Notes on the twisted graph. In: M\u00e1rquez, A., Ramos, P., Urrutia, J. (eds) Computational Geometry. EGC 2011. Lecture Notes in Computer Science, vol. 7579, pp. 119\u2013125. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-34191-5_11"},{"key":"2538_CR13","doi-asserted-by":"publisher","unstructured":"Pach, J., Radoi\u010di\u0107, R., Tardos, G., T\u00f3th, G.: Improving the crossing lemma by finding more crossings in sparse graphs. Discrete Comput. Geom. 36, 527\u2013552 (2006). https:\/\/doi.org\/10.1007\/s00454-006-1264-9","DOI":"10.1007\/s00454-006-1264-9"},{"key":"2538_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, 311\u2013320 (2003). https:\/\/doi.org\/10.1007\/s00454-003-0012-9","journal-title":"Discrete Comput. Geom."},{"key":"2538_CR15","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s004540010011","volume":"24","author":"J Pach","year":"2000","unstructured":"Pach, J., Spencer, J., T\u00f3th, G.: New bounds on crossing numbers. Discrete Comput. Geom. 24, 623\u2013644 (2000). https:\/\/doi.org\/10.1007\/s004540010011","journal-title":"Discrete Comput. Geom."},{"key":"2538_CR16","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17\u20133","author":"J Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica 17\u20133, 427\u2013439 (1997). https:\/\/doi.org\/10.1007\/BF01215922","journal-title":"Combinatorica"},{"key":"2538_CR17","doi-asserted-by":"publisher","unstructured":"Purchase, H.: Which aesthetic has the greatest effect on human understanding? In: Proceedings of the Symposium on Graph Drawing (GD\u201997). LNCS, vol. 1353, pp. 248\u2013261. Springer, Berlin (1997). https:\/\/doi.org\/10.1007\/3-540-63938-1_67","DOI":"10.1007\/3-540-63938-1_67"},{"key":"2538_CR18","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-44541-2_2","volume":"6\u20133","author":"HC Purchase","year":"2002","unstructured":"Purchase, H.C., Carrington, D., Allder, J.: Graph layout aesthetics in UML diagrams: user preferences. J. Graph Algorithms Appl. 6\u20133, 255\u2013279 (2002). https:\/\/doi.org\/10.1007\/3-540-44541-2_2","journal-title":"J. Graph Algorithms Appl."},{"key":"2538_CR19","doi-asserted-by":"publisher","DOI":"10.1201\/9781315152394","volume-title":"Crossing Numbers of Graphs","author":"M Schaefer","year":"2018","unstructured":"Schaefer, M.: Crossing Numbers of Graphs. CRC Press, Boca Raton (2018). https:\/\/doi.org\/10.1201\/9781315152394"},{"key":"2538_CR20","doi-asserted-by":"publisher","unstructured":"Schaefer, M.: The graph crossing number and its variants: a survey. Electron. J. Comb. DS21 (2022). https:\/\/doi.org\/10.37236\/2713","DOI":"10.37236\/2713"},{"key":"2538_CR21","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1017\/S0963548397002976","volume":"7","author":"LA Sz\u00e9kely","year":"1997","unstructured":"Sz\u00e9kely, L.A.: Crossing numbers and hard Erdos problems in discrete geometry. Probab. Comput. 7, 353\u2013358 (1997). https:\/\/doi.org\/10.1017\/S0963548397002976","journal-title":"Probab. Comput."},{"key":"2538_CR22","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1002\/jgt.3190010105","volume":"1","author":"P Tur\u00e1n","year":"1977","unstructured":"Tur\u00e1n, P.: A note of welcome. J. Graph Theory 1, 7\u20139 (1977). https:\/\/doi.org\/10.1002\/jgt.3190010105","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02538-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02538-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02538-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T19:42:58Z","timestamp":1667418178000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02538-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,8]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["2538"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02538-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,8,8]]},"assertion":[{"value":"4 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}],"article-number":"134"}}