{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T18:25:57Z","timestamp":1703010357143},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00493-021-4285-3","type":"journal-article","created":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T13:17:03Z","timestamp":1647263823000},"page":"701-728","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c \u2264 12"],"prefix":"10.1007","volume":"42","author":[{"given":"Drago","family":"Bokal","sequence":"first","affiliation":[]},{"given":"Zden\u0115k","family":"Dvo\u0159\u00e1k","sequence":"additional","affiliation":[]},{"given":"Petr","family":"Hlin\u0115n\u00fd","sequence":"additional","affiliation":[]},{"given":"Jes\u00fas","family":"Lea\u00f1os","sequence":"additional","affiliation":[]},{"given":"Bojan","family":"Mohar","sequence":"additional","affiliation":[]},{"given":"Tilo","family":"Wiedera","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,14]]},"reference":[{"key":"4285_CR1","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1002\/jgt.10097","volume":"42","author":"B Pinontoan","year":"2003","unstructured":"B. Pinontoan and R. B. Richter: Crossing numbers of sequences of graphs II: planar tiles, J. Graph Theory 42 (2003), 332\u2013341.","journal-title":"J. Graph Theory"},{"key":"4285_CR2","doi-asserted-by":"crossref","unstructured":"B. Mohar and C. Thomassen: Graphs on Surfaces, Johns Hopkins University Press, 2001.","DOI":"10.56021\/9780801866890"},{"key":"4285_CR3","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1016\/j.disc.2006.07.013","volume":"307","author":"B Mohar","year":"2007","unstructured":"B. Mohar, R. J. Nowakowski and D. B. West: Research problems from the 5th Slovenian Conference (Bled, 2003), Discrete Math. 307 (2007), 650\u2013658.","journal-title":"Discrete Math."},{"key":"4285_CR4","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.jctb.2011.04.006","volume":"102","author":"C Hern\u00e1ndez-V\u00e9lez","year":"2012","unstructured":"C. Hern\u00e1ndez-V\u00e9lez, G. Salazar and R. Thomas: Nested cycles in large triangulations and crossing-critical graphs, J. Comb. Theory, Series B 102 (2012), 86\u201392.","journal-title":"J. Comb. Theory, Series B"},{"key":"4285_CR5","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/jgt.20470","volume":"65","author":"D Bokal","year":"2010","unstructured":"D. Bokal: Infinite families of crossing-critical graphs with prescribed average degree and crossing number, J. Graph Theory 65 (2010), 139\u2013162.","journal-title":"J. Graph Theory"},{"key":"4285_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.aam.2015.10.003","volume":"74","author":"D Bokal","year":"2016","unstructured":"D. Bokal, B. Oporowski, R. B. Richter and G. Salazar: Characterizing 2-crossing-critical graphs, Advances in Appl. Math. 74 (2016), 23\u2013208.","journal-title":"Advances in Appl. Math."},{"key":"4285_CR7","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1016\/j.ejc.2013.02.002","volume":"34","author":"D Bokal","year":"2013","unstructured":"D. Bokal, M. Chimani and J. Lea\u00f1os: Crossing number additivity over edge cuts, Eur. J. Comb. 34 (2013), 1010\u20131018.","journal-title":"Eur. J. Comb."},{"key":"4285_CR8","doi-asserted-by":"crossref","first-page":"#P1.40","DOI":"10.37236\/7429","volume":"26","author":"D Bokal","year":"2019","unstructured":"D. Bokal, M. Bra\u010di\u010d, M. Dern\u00e1r and P. Hlin\u0115N\u00fa: On degree properties of crossing-critical families of graphs, Electron. J. Comb. 26 (2019), #P1.40.","journal-title":"Electron. J. Comb."},{"key":"4285_CR9","first-page":"1","volume-title":"35th International Symposium on Computational Geometry (SoCG 2019), volume 129 of Leibniz International Proceedings in Informatics (LIPIcs)","author":"D Bokal","year":"2019","unstructured":"D. Bokal, Z. Dvor\u00e1k, P. Hlin\u0115n\u00fa, J. Lea\u00f1os, B. Mohar and T. Wiedera: Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c \u2264 12, in: Gill Barequet and Yusu Wang, editors, 35th International Symposium on Computational Geometry (SoCG 2019), volume 129 of Leibniz International Proceedings in Informatics (LIPIcs), 14, 1\u201315, 2019, Schloss Dagstuhl\u2014Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany."},{"key":"4285_CR10","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1142\/S0218216508006531","volume":"17","author":"J Lea\u00f1os","year":"2008","unstructured":"J. Lea\u00f1os and G. Salazar: On the additivity of crossing numbers of graphs, Journal of Knot Theory and Its Ramifications \u2014 JKTR 17 (2008), 1043\u20131050.","journal-title":"Journal of Knot Theory and Its Ramifications \u2014 JKTR"},{"key":"4285_CR11","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1016\/j.ejc.2003.07.007","volume":"25","author":"J Geelen","year":"2004","unstructured":"J. Geelen, R. B. Richter and G. Salazar: Embedding grids in surfaces, European Journal of Combinatorics 25 (2004), 785\u2013792.","journal-title":"European Journal of Combinatorics"},{"key":"4285_CR12","volume-title":"Complexity Issues in VLSI: Optimal Layouts for the Shuffle-exchange Graph and Other Networks","author":"F T Leighton","year":"1983","unstructured":"F. T. Leighton: Complexity Issues in VLSI: Optimal Layouts for the Shuffle-exchange Graph and Other Networks, MIT Press, Cambridge, MA, USA, 1983."},{"key":"4285_CR13","series-title":"LIPIcs 57","first-page":"1","volume-title":"ESA 2016","author":"M Chimani","year":"2016","unstructured":"M. Chimani and T. Wiedera: An ILP-based proof system for the crossing number problem, in: ESA 2016, LIPIcs 57, 29, 1\u201313, 2016, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany."},{"key":"4285_CR14","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0012-365X(87)90108-7","volume":"66","author":"M Kochol","year":"1987","unstructured":"M. Kochol: Construction of crossing-critical graphs, Discrete Math. 66 (1987), 311\u2013313.","journal-title":"Discrete Math."},{"key":"4285_CR15","doi-asserted-by":"crossref","unstructured":"M. Ajtai, V. Chv\u00e1tal, M. M. Newborn and E. Szemer\u00e1di: Crossing-Free Subgraphs, volume 60 of North-Holland Mathematics Studies, North-Holland, 1982.","DOI":"10.1016\/S0304-0208(08)73484-4"},{"key":"4285_CR16","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0095-8956(03)00037-6","volume":"88","author":"P Hlin\u0115n\u00fd","year":"2003","unstructured":"P. Hlin\u0115n\u00fd: Crossing-number critical graphs have bounded path-width, J. Comb. Theory, Series B 88 (2003), 347\u2013367.","journal-title":"J. Comb. Theory, Series B"},{"key":"4285_CR17","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1002\/jgt.20473","volume":"65","author":"P Hlin\u0115n\u00fd","year":"2010","unstructured":"P. Hlin\u0115n\u00fd and G. Salazar: Stars and bonds in crossing-critical graphs, J. Graph Theory 65 (2010), 198\u2013215.","journal-title":"J. Graph Theory"},{"key":"4285_CR18","doi-asserted-by":"crossref","unstructured":"P. Hlin\u0115n\u00e1 and M. Korbela: On 13-crossing-critical graphs with arbitrarily large degrees, 2021, in: Extended Abstracts EuroComb 2021, Trends in Mathematics, 50\u201356, Springer, 2021.","DOI":"10.1007\/978-3-030-83823-2_9"},{"key":"4285_CR19","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1006\/jctb.1993.1038","volume":"58","author":"R B Richter","year":"1993","unstructured":"R. B. Richter and C. Thomassen: Minimal graphs with crossing number at least k, J. Comb. Theory, Series B 58 (1993), 217\u2013224.","journal-title":"J. Comb. Theory, Series B"},{"key":"4285_CR20","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0012-365X(84)90140-7","volume":"48","author":"J \u0160ir\u00e1\u0148","year":"1984","unstructured":"J. \u0160ir\u00e1\u0148: Infinite families of crossing-critical graphs with a given crossing number, Discrete Math. 48 (1984), 129\u2013132.","journal-title":"Discrete Math."},{"key":"4285_CR21","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.jctb.2009.11.003","volume":"100","author":"Z Dvo\u0159\u00e1k","year":"2010","unstructured":"Z. Dvo\u0159\u00e1k and B. Mohar: Crossing-critical graphs with large maximum degree, J. Comb. Theory, Series B 100 (2010), 413\u2013417.","journal-title":"J. Comb. Theory, Series B"},{"key":"4285_CR22","series-title":"LIPIcs 99","first-page":"1","volume-title":"SoCG 2018","author":"Z Dvo\u0159\u00e1k","year":"2018","unstructured":"Z. Dvo\u0159\u00e1k, P. Hlin\u0159n\u00fd and B. Mohar: Structure and generation of crossing-critical graphs, in: SoCG 2018, LIPIcs 99, 33, 1\u201314, 2018, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-021-4285-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-021-4285-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-021-4285-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,18]],"date-time":"2023-11-18T20:21:44Z","timestamp":1700338904000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-021-4285-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,14]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["4285"],"URL":"https:\/\/doi.org\/10.1007\/s00493-021-4285-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,14]]},"assertion":[{"value":"2 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}