{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:35Z","timestamp":1759063835220,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T00:00:00Z","timestamp":1567555200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T00:00:00Z","timestamp":1567555200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["DMS-1400653"],"award-info":[{"award-number":["DMS-1400653"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s00373-019-02076-5","type":"journal-article","created":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T05:53:56Z","timestamp":1567576436000},"page":"205-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Bipartite-Cylindrical Crossing Number of the Complete Bipartite Graph"],"prefix":"10.1007","volume":"36","author":[{"given":"Bernardo","family":"\u00c1brego","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2080-106X","authenticated-orcid":false,"given":"Silvia","family":"Fern\u00e1ndez-Merchant","sequence":"additional","affiliation":[]},{"given":"Athena","family":"Sparks","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,4]]},"reference":[{"key":"2076_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)","journal-title":"Discrete Comput. Geom."},{"key":"2076_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)","journal-title":"Discrete Comput. Geom."},{"key":"2076_CR3","unstructured":"\u00c1brego, B.M., Aichholzer, O., Fern\u00e1ndez-Merchant, S., Ramos, P., Vogtenhuber, V.: Non-shellable drawings of $$ K_n $$ with few crossings. In: Proceedings of 26th Annual Canadian Conference on Computational Geometry CCCG 2014, Halifax, Nova Scotia (2014)"},{"key":"2076_CR4","unstructured":"Bla\u017eek, J., Koman, M.: A minimal problem concerning complete plane graphs. In: Fiedler, M. (ed.) Theory of Graphs and Its Applications, Czech. Academy of Sciences, pp. 113\u2013117 (1964)"},{"key":"2076_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0608002","volume":"8","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. Discrete Math. 8, 33\u201358 (1987)","journal-title":"SIAM J. Discrete Math."},{"key":"2076_CR6","unstructured":"Guy, R.K.: The decline and fall of Zarankiewicz\u2019s theorem, Proof Techniques in Graph Theory (Proc. Second Ann Arbor Graph Theory Conf., Ann Arbor, Mich., 1968). Academic Press, New York, pp. 63\u201369 (1969)"},{"key":"2076_CR7","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1017\/S0013091500025645","volume":"13","author":"F Harary","year":"1963","unstructured":"Harary, F., Hill, H.: On the number of crossings in a complete graph. Proc. Edinb. Math. Soc. 13, 333\u2013338 (1963)","journal-title":"Proc. Edinb. Math. Soc."},{"key":"2076_CR8","volume-title":"Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks","author":"FT Leighton","year":"1983","unstructured":"Leighton, F.T.: Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks. MIT Press, Cambridge (1983)"},{"key":"2076_CR9","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/s00454-008-9058-x","volume":"39\u20131","author":"MJ Pelsmajer","year":"2008","unstructured":"Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Odd crossing number and crossing number are not the same. Discrete Comput. Geom. 39\u20131, 442\u2013454 (2008)","journal-title":"Discrete Comput. Geom."},{"key":"2076_CR10","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1080\/00029890.1997.11990611","volume":"104\u20132","author":"RB Richter","year":"1997","unstructured":"Richter, R.B., Thomassen, C.: Relations between crossing numbers of complete and complete bipartite graphs. Am. Math. Mon. 104\u20132, 131\u201337 (1997)","journal-title":"Am. Math. Mon."},{"key":"2076_CR11","first-page":"9","volume":"DS21","author":"M Schaefer","year":"2014","unstructured":"Schaefer, M.: The graph crossing number and its variants: a survey. Electron. J. Combin. DS21, 9 (2014)","journal-title":"Electron. J. Combin."},{"key":"2076_CR12","doi-asserted-by":"crossref","unstructured":"Shahrokhi, F., Shi, W.: Efficient deterministic algorithms for embedding graphs on books, Computing and Combinatorics (Hong Kong, 1996), 162\u2013168, Lecture Notes in Computer Science, vol. 1090. Springer, Berlin (1996)","DOI":"10.1007\/3-540-61332-3_149"},{"key":"2076_CR13","unstructured":"Shahrokhi, F., S\u00fdkora, O., Sz\u00e9kely, L.A., Vr\u0165o, I.: Crossing numbers: bounds and applications. Intuitive Geometry (Budapest, 1995), 179\u2013206, Bolyai Soc. Math. Stud., vol. 6. J\u00e1nos Bolyai Math. Soc., Budapest (1997)"},{"key":"2076_CR14","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)","journal-title":"J. Graph Theory"},{"key":"2076_CR15","first-page":"15","volume-title":"Selected Topics in Graph Theory","author":"AT White","year":"1978","unstructured":"White, A.T., Beineke, L.W.: Topological graph theory. In: Beineke, L.W., Wilson, R.J. (eds.) Selected Topics in Graph Theory, pp. 15\u201350. Academic Press, New York (1978)"},{"key":"2076_CR16","doi-asserted-by":"publisher","first-page":"137","DOI":"10.4064\/fm-41-1-137-145","volume":"41\u20131","author":"K Zarankiewicz","year":"1955","unstructured":"Zarankiewicz, K.: On a problem of P. Tur\u00e1n concerning graphs. Fundam. Math. 41\u20131, 137\u2013145 (1955)","journal-title":"Fundam. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02076-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02076-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02076-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T23:29:16Z","timestamp":1599089356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02076-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,4]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["2076"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02076-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2019,9,4]]},"assertion":[{"value":"5 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}