{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:04:54Z","timestamp":1740107094740,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T00:00:00Z","timestamp":1593302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T00:00:00Z","timestamp":1593302400000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s00373-020-02204-6","type":"journal-article","created":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T15:03:20Z","timestamp":1593356600000},"page":"1713-1721","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["There Are No Cubic Graphs on 26 Vertices with Crossing Number 10 or 11"],"prefix":"10.1007","volume":"36","author":[{"given":"Kieran","family":"Clancy","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8143-6583","authenticated-orcid":false,"given":"Michael","family":"Haythorpe","sequence":"additional","affiliation":[]},{"given":"Alex","family":"Newcombe","sequence":"additional","affiliation":[]},{"suffix":"Jr","given":"Ed","family":"Pegg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,28]]},"reference":[{"issue":"5","key":"2204_CR1","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1137\/120872310","volume":"42","author":"S Cabello","year":"2013","unstructured":"Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. SIAM J. Comput. 42(5), 1803\u20131829 (2013)","journal-title":"SIAM J. Comput."},{"key":"2204_CR2","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.1016\/j.disc.2007.12.078","volume":"309","author":"M Chimani","year":"2009","unstructured":"Chimani, M., Gutwenger, C.: Non-planar core reduction of graphs. Discrete Math. 309, 1838\u20131855 (2009)","journal-title":"Discrete Math."},{"key":"2204_CR3","unstructured":"Chimani, M., Wiedera, T.: \u201c An ILP-based Proof System for the Crossing Number Problem\u201d, In: 24th European Symposium of Algorithms (ESA) 2016, Aarhus, Denmark, Leibniz. Int. Prov. Inform. 56:29.1\u201329.13 (2016)"},{"issue":"2","key":"2204_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.7155\/jgaa.00487","volume":"23","author":"K Clancy","year":"2019","unstructured":"Clancy, K., Haythorpe, M., Newcombe, A.: An effective crossing minimisation heuristic based on star insertion. J. Graph Algorithms Appl. 23(2), 135\u2013166 (2019)","journal-title":"J. Graph Algorithms Appl."},{"key":"2204_CR5","unstructured":"Clancy, K., Haythorpe, M., Newcombe, A.: \u201c A survey of graphs with known or bounded crossing numbers\u201d, submitted to Australasian Journal of Combinatorics. Available at: arXiv:1901.05155"},{"issue":"1","key":"2204_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1112\/plms\/s3-46.1.117","volume":"3","author":"HSM Coxeter","year":"1983","unstructured":"Coxeter, H.S.M.: My graph. Proc. Lond. Math. Soc. 3(1), 117\u2013136 (1983)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"3","key":"2204_CR7","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"MR Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algeb. Discrete Methods 4(3), 312\u2013316 (1983)","journal-title":"SIAM J. Algeb. Discrete Methods"},{"issue":"4","key":"2204_CR8","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.jctb.2005.09.009","volume":"96","author":"P Hlin\u011bny","year":"2006","unstructured":"Hlin\u011bny, P.: Crossing number is hard for cubic graphs. J. Comb. Theory Ser. B 96(4), 455\u2013471 (2006)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2204_CR9","doi-asserted-by":"crossref","unstructured":"Holton, D.A., Sheehan, J.: The Petersen Graph. Cambridge University Press (1993)","DOI":"10.1017\/CBO9780511662058"},{"issue":"3","key":"2204_CR10","first-page":"68","volume":"2010","author":"Y Huang","year":"2010","unstructured":"Huang, Y., Wang, J.: Survey of the crossing number of graphs. J. East China Normal Univ. Natl. Sci. 2010(3), 68\u201380 (2010)","journal-title":"J. East China Normal Univ. Natl. Sci."},{"key":"2204_CR11","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Reed, B.: Computing crossing number in linear time. Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp.382\u2013390 (2007)","DOI":"10.1145\/1250790.1250848"},{"issue":"1","key":"2204_CR12","doi-asserted-by":"publisher","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"C Kuratowski","year":"1930","unstructured":"Kuratowski, C.: Sur le probleme des courbes gauches en topologie. Fund. Math. 15(1), 271\u2013283 (1930)","journal-title":"Fund. Math."},{"key":"2204_CR13","unstructured":"Levi, F.W.: \u201c Finite geometrical systems\u201d, University of Calcutta (1942)"},{"key":"2204_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/(SICI)1097-0118(199902)30:2<137::AID-JGT7>3.0.CO;2-G","volume":"30","author":"M Meringer","year":"1999","unstructured":"Meringer, M.: Fast generation of regular graphs and constructions of cages. J. Graph Theory 30, 137\u2013146 (1999)","journal-title":"J. Graph Theory"},{"key":"2204_CR15","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s4540010011","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)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"2204_CR16","first-page":"161","volume":"11","author":"E Pegg Jr","year":"2009","unstructured":"Pegg Jr., E., Exoo, G.: Crossing number graphs. Math. J. 11(2), 161\u2013170 (2009)","journal-title":"Math. J."},{"key":"2204_CR17","doi-asserted-by":"publisher","unstructured":"Robertson, N., Seymour, P., Thomas, R.: \u201cExcluded minors in cubic graphs\u201d. J. Comb. Theory Ser. B (2019). https:\/\/doi.org\/10.1016\/j.jctb.2019.02.002","DOI":"10.1016\/j.jctb.2019.02.002"},{"key":"2204_CR18","unstructured":"Schaefer, M.: \u201c The graph crossing number and its variants: A survey\u201d. Electron. J. Comb. DS21 (2017)"},{"key":"2204_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)"},{"key":"2204_CR20","unstructured":"Sloane, N.J.A.: \u201c A110507: Number of nodes in the smallest cubic graph with crossing number $$n$$\u201d, The On-line Encyclopedia of Integer Sequences, 2007. Available at: https:\/\/oeis.org\/A110507. Accessed 17 Sept 2019"},{"key":"2204_CR21","unstructured":"Vrt\u2019o, I.: \u201c Bibliography on crossing numbers\u201d, Available at: ftp:\/\/ftp.ifi.savba.sk\/pub\/imrich\/crobib.pdf, last updated (2014). Accessed 17 Sept 2019"},{"key":"2204_CR22","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/S0021-9800(69)80116-X","volume":"6","author":"ME Watkins","year":"1969","unstructured":"Watkins, M.E.: A theorem on tait colorings with an application to the generalized petersen graphs. J. Comb. Theory 6, 152\u2013164 (1969)","journal-title":"J. Comb. Theory"},{"key":"2204_CR23","unstructured":"Weisstein, E.W.: \u201c Smallest Cubic Crossing Number Graphs\u201d, From: Mathworld\u2013A Wolfram Web Resource. http:\/\/mathworld.wolfram.com\/SmallestCubicCrossingNumberGraph.html, updated April 10th (2019). Accessed 17 Sept 2019"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02204-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02204-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02204-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,27]],"date-time":"2021-06-27T23:08:17Z","timestamp":1624835297000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02204-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,28]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["2204"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02204-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,6,28]]},"assertion":[{"value":"23 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}