{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:24:36Z","timestamp":1786980276716,"version":"build-2736575974"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T00:00:00Z","timestamp":1630368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T00:00:00Z","timestamp":1630368000000},"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":["Combinatorica"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s00493-021-4390-3","type":"journal-article","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T10:04:40Z","timestamp":1630404280000},"page":"137-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A New Upper Bound on the Chromatic Number of Graphs with No Odd Kt Minor"],"prefix":"10.1007","volume":"42","author":[{"given":"Sergey","family":"Norin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zi-Xia","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,8,31]]},"reference":[{"key":"4390_CR1","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF01261316","volume":"16","author":"B Bollob\u00e1s","year":"1996","unstructured":"B. Bollob\u00e1s and A. Thomason: Highly linked graphs, Combinatorica 16 (1996), 313\u2013320.","journal-title":"Combinatorica"},{"key":"4390_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0012-365X(78)90049-3","volume":"22","author":"P A Catlin","year":"1978","unstructured":"P. A. Catlin: A bound on the chromatic number of a graph, Discrete Math. 22 (1978), 81\u201383.","journal-title":"Discrete Math."},{"key":"4390_CR3","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s00493-006-0030-1","volume":"26","author":"M Chudnovsky","year":"2006","unstructured":"M. Chudnovsky, J. Geelen, B. Gerards, L. Goddyn, M. Lohman and P. Seymour: Packing non-zero A-paths in group-labelled graphs, Combinatorica 26 (2006), 521\u2013532.","journal-title":"Combinatorica"},{"key":"4390_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02760037","volume":"3","author":"P Erd\u0151s","year":"1965","unstructured":"P. Erd\u0151s: On some extremal problems in graph theory, Israel. J. Math. 3 (1965), 113\u2013116.","journal-title":"Israel. J. Math."},{"key":"4390_CR5","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.jctb.2008.03.006","volume":"99","author":"J Geelen","year":"2009","unstructured":"J. Geelen, B. Gerards, B. Reed, P. Seymour and A. Vetta: On the odd-minor variant of Hadwiger\u2019s conjecture, J. Combin. Theory Ser. B 99 (2009), 20\u201329.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4390_CR6","first-page":"133","volume":"88","author":"H Hadwiger","year":"1943","unstructured":"H. Hadwiger: \u00dcber eine Klassifikation der Streckenkomplexe, Vierteljschr. Naturforsch. Ges. Z\u00fcrich 88 (1943), 133\u2013142.","journal-title":"Vierteljschr. Naturforsch. Ges. Z\u00fcrich"},{"key":"4390_CR7","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","volume-title":"Graph coloring problems","author":"T R Jensen","year":"1995","unstructured":"T. R. Jensen and B. Toft: Graph coloring problems, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., New York, 1995. A Wiley-Interscience Publication."},{"key":"4390_CR8","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.jctb.2008.12.001","volume":"99","author":"K Kawarabayashi","year":"2009","unstructured":"K. Kawarabayashi: Note on coloring graphs without odd-Kk-minors, J. Combin. Theory Ser. B 99 (2009), 728\u2013731.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4390_CR9","first-page":"37","volume":"38","author":"A V Kostochka","year":"1982","unstructured":"A. V. Kostochka: The minimum Hadwiger number for graphs with a given mean degree of vertices, Metody Diskret. Analiz. 38 (1982), 37\u201358.","journal-title":"Metody Diskret. Analiz."},{"key":"4390_CR10","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02579141","volume":"4","author":"A V Kostochka","year":"1984","unstructured":"A. V. Kostochka: Lower bound of the Hadwiger number of graphs by their average degree, Combinatorica 4 (1984), 307\u2013316.","journal-title":"Combinatorica"},{"key":"4390_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00493-009-2178-y","volume":"29","author":"K-I Kawarabayashi","year":"2009","unstructured":"K.-i. Kawarabayashi and B. Reed: Highly parity linked graphs, Combinatorica 29 (2009), 215\u2013225.","journal-title":"Combinatorica"},{"key":"4390_CR12","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00493-007-2213-9","volume":"27","author":"K-I Kawarabayashi","year":"2007","unstructured":"K.-i. Kawarabayashi and Z.-X. Song: Some remarks on the odd Hadwiger\u2019s conjecture, Combinatorica 27 (2007), 429\u2013438.","journal-title":"Combinatorica"},{"key":"4390_CR13","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BF02993903","volume":"37","author":"W Mader","year":"1972","unstructured":"W. Mader: Existence of n-times connected subgraphs in graphs having large edge density, in: Essays from the Mathematical Seminar of the University of Hamburg, volume 37, 86\u201397, 1972.","journal-title":"Essays from the Mathematical Seminar of the University of Hamburg"},{"key":"4390_CR14","unstructured":"S. Norin and Z.-X. Song: Breaking the degeneracy barrier for coloring graphs with no Kt minor, 2019. arXiv:1910.09378."},{"key":"4390_CR15","unstructured":"L. Postle: Halfway to Hadwiger\u2019s Conjecture, 2019. arXiv:1911.01491."},{"key":"4390_CR16","doi-asserted-by":"crossref","unstructured":"P. Seymour: Hadwiger\u2019s conjecture, in: Open problems in mathematics, 417\u2013437, Springer, 2016.","DOI":"10.1007\/978-3-319-32162-2_13"},{"key":"4390_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1017\/S0305004100061521","volume":"95","author":"A Thomason","year":"1984","unstructured":"A. Thomason: An extremal function for contractions of graphs, Math. Proc. Cambridge Philos. Soc. 95 (1984), 261\u2013265.","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"4390_CR18","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1006\/jctb.2000.2013","volume":"81","author":"A Thomason","year":"2001","unstructured":"A. Thomason: The extremal function for complete minors, J. Combin. Theory Ser. B 81 (2001), 318\u2013338.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4390_CR19","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.ejc.2004.02.013","volume":"26","author":"R Thomas","year":"2005","unstructured":"R. Thomas and P. Wollan: An improved linear edge bound for graph linkages, European J. Combin. 26 (2005), 309\u2013324.","journal-title":"European J. Combin."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-021-4390-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-021-4390-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-4390-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T14:07:00Z","timestamp":1653314820000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-021-4390-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,31]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["4390"],"URL":"https:\/\/doi.org\/10.1007\/s00493-021-4390-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,31]]},"assertion":[{"value":"2 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}