{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:43:56Z","timestamp":1742924636799,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501055"},{"type":"electronic","value":"9783319501062"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50106-2_33","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"427-438","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Crossing Number of the Cone of a Graph"],"prefix":"10.1007","author":[{"given":"Carlos A.","family":"Alfaro","sequence":"first","affiliation":[]},{"given":"Alan","family":"Arroyo","sequence":"additional","affiliation":[]},{"given":"Marek","family":"Der\u0148\u00e1r","sequence":"additional","affiliation":[]},{"given":"Bojan","family":"Mohar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Albertson, M.O., Cranston, D.W., Fox, J.: Crossings, colorings and cliques. Electron. J. Comb. 16, #R45 (2009)","DOI":"10.37236\/134"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-662-45803-7_18","volume-title":"Graph Drawing","author":"MJ Bannister","year":"2014","unstructured":"Bannister, M.J., Eppstein, D.: Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 210\u2013221. Springer, Heidelberg (2014). doi:\n                      10.1007\/978-3-662-45803-7_18"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Bar\u00e1t, J., T\u00f3th, G.: Towards the Albertson conjecture. Electron. J. Comb. 17, #R73 (2010)","DOI":"10.37236\/345"},{"key":"33_CR4","unstructured":"Bollob\u00e1s, B., Scott, A.D.: Better bounds for Max Cut. In: Contemporary Combinatorics. Bolyai Soc. Math. Stud. vol. 10, pp. 185\u2013246. J\u00e1nos Bolyai Math. Soc., Budapest (2002)"},{"key":"33_CR5","first-page":"507","volume-title":"Lecture Notes in Computer Science","author":"Christoph Buchheim","year":"2006","unstructured":"Buchheim, C., Zheng, L.: Fixed linear crossing minimization by reduction to the maximum cut problem. In: Computing and Combinatorics, pp. 507\u2013516 (2006)"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/0095-8956(79)90062-5","volume":"26","author":"PA Catlin","year":"1979","unstructured":"Catlin, P.A.: Hajos\u2019 graph-coloring conjecture: variations and counterexamples. J. Comb. Theory Ser. B 26, 268\u2013274 (1979)","journal-title":"J. Comb. Theory Ser. B"},{"key":"33_CR7","first-page":"283","volume":"18","author":"P Erd\u0151s","year":"1967","unstructured":"Erd\u0151s, P.: Gr\u00e1fok p\u00e1ros k\u00f6r\u00fclj\u00e1r\u00e1s\u00fa r\u00e9sgr\u00e1fjair\u00f3l (On bipartite subgraphs of graphs in Hungarian). Mat. Lapok 18, 283\u2013288 (1967)","journal-title":"Mat. Lapok"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"475","DOI":"10.4153\/CJM-1973-048-x","volume":"25","author":"CS Edwards","year":"1973","unstructured":"Edwards, C.S.: Some extremal properties of bipartite subgraphs. Can. J. Math. 25, 475\u2013485 (1973)","journal-title":"Can. J. Math."},{"key":"33_CR9","unstructured":"Edwards, C.S.: An improved lower bound for the number of edges in a largest bipartite subgraph. In: Recent Advances in Graph Theory, pp. 167\u2013181 (1975)"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1017\/S0013091500025645","volume":"13","author":"F Harary","year":"1963","unstructured":"Harary, F., Hill, A.: On the number of crossings in a complete graph. Proc. Edinb. Math. Soc. 13, 333\u2013338 (1963)","journal-title":"Proc. Edinb. Math. Soc."},{"key":"33_CR11","first-page":"127","volume":"71","author":"PC Kainen","year":"1990","unstructured":"Kainen, P.C.: The book thickness of a graph II. Congr. Numerantium 71, 127\u2013132 (1990)","journal-title":"Congr. Numerantium"},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s10107-006-0039-7","volume":"109","author":"E De Klerk","year":"2007","unstructured":"De Klerk, E., Pasechnik, D.V., Schrijver, A.: Reduction of symmetric semidefinite programs using the regular $$\\ast $$-representation. Math. Program. 109, 613\u2013624 (2007)","journal-title":"Math. Program."},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1137\/120886777","volume":"27","author":"E de Klerk","year":"2013","unstructured":"de Klerk, E., Pasechnik, D., Salazar, G.: Improved lower bounds on book crossing numbers of complete graphs. SIAM J. Discret. Math. 27, 619\u2013633 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"2948","DOI":"10.1016\/j.disc.2008.07.040","volume":"309","author":"B Oporowski","year":"2009","unstructured":"Oporowski, B., Zhao, D.: Coloring graphs with crossings. Discret. Math. 309, 2948\u20132951 (2009)","journal-title":"Discret. Math."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50106-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:42:37Z","timestamp":1600476157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}