{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T22:44:34Z","timestamp":1780785874890,"version":"3.54.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,10,28]],"date-time":"2019-10-28T00:00:00Z","timestamp":1572220800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,28]],"date-time":"2019-10-28T00:00:00Z","timestamp":1572220800000},"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":["Combinatorica"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s00493-019-3848-z","type":"journal-article","created":{"date-parts":[[2019,10,28]],"date-time":"2019-10-28T11:09:00Z","timestamp":1572260940000},"page":"1387-1412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Clustered Colouring in Minor-Closed Classes"],"prefix":"10.1007","volume":"39","author":[{"given":"Sergey","family":"Norin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alex","family":"Scott","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Seymour","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,10,28]]},"reference":[{"key":"3848_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0095-8956(02)00006-0","volume":"87","author":"N Alon","year":"2003","unstructured":"N. Alon, G. Ding, B. Oporowski and D. Vertigan: Partitioning into graphs with only small components, J. Combin. Theory Ser. B 87 (2003), 231\u2013243.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3848_CR2","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/2820609","volume":"63","author":"C Chekuri","year":"2016","unstructured":"C. Chekuri and J. Chuzhoy: Polynomial bounds for the grid-minor theorem, J. ACM 63 (2016), 40.","journal-title":"J. ACM"},{"key":"3848_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.jctb.2003.09.001","volume":"91","author":"M DeVos","year":"2004","unstructured":"M. DeVos, G. Ding, B. Oporowski, D. P. Sanders, B. Reed, P. Seymour and D. Vertigan: Excluding any graph as a minor allows a low tree-width 2-coloring, J. Combin. Theory Ser. B 91 (2004), 25\u201341.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3848_CR4","volume-title":"Islands in minor-closed classes. I. Bounded treewidth and separators","author":"Z Dvo\u0161\u00e1k","year":"2017","unstructured":"Z. Dvo\u0161\u00e1k and S. Norin: Islands in minor-closed classes. I. Bounded treewidth and separators, 2017, arXiv:1710.02727."},{"key":"3848_CR5","doi-asserted-by":"publisher","first-page":"2385","DOI":"10.1137\/141002177","volume":"29","author":"K Edwards","year":"2015","unstructured":"K. Edwards, D. Y. Kang, J. Kim, S. Oum and P. Seymour: A relative of Had- wiger\u2019s conjecture, SIAM J. Discrete Math. 29 (2015), 2385\u20132388.","journal-title":"SIAM J. Discrete Math."},{"key":"3848_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1112\/jlms.12127","volume":"98","author":"J van den Heuvel","year":"2018","unstructured":"J. van den Heuvel and D. R. Wood: Improper colourings inspired by Hadwiger\u2019s conjecture, J. London Math. Soc. 98 (2018), 129\u2013148.","journal-title":"J. London Math. Soc."},{"key":"3848_CR7","volume-title":"Combin. Probab. Comput.","author":"D Y Kang","year":"2019","unstructured":"D. Y. Kang and S. Oum: Improper coloring of graphs with no odd clique minor, Combin. Probab. Comput., 2019, arXiv:1612.05372."},{"key":"3848_CR8","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1017\/S0963548308009462","volume":"17","author":"K Kawarabayashi","year":"2008","unstructured":"K. Kawarabayashi: A weakening of the odd Hadwiger\u2019s conjecture, Combin. Probab. Comput. 17 (2008), 815\u2013821.","journal-title":"Combin. Probab. Comput."},{"key":"3848_CR9","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/j.jctb.2006.11.002","volume":"97","author":"K Kawarabayashi","year":"2007","unstructured":"K. Kawarabayashi and B. Mohar: A relaxed Hadwiger\u2019s conjecture for list colorings, J. Combin. Theory Ser. B 97 (2007), 647\u2013651.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3848_CR10","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":"3848_CR11","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":"3848_CR12","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jctb.2014.09.003","volume":"111","author":"A Leaf","year":"2015","unstructured":"A. Leaf and P. Seymour: Tree-width and planar minors, J. Comb. Theory, Ser. B 111 (2015), 38\u201353.","journal-title":"J. Comb. Theory, Ser. B"},{"key":"3848_CR13","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.jctb.2017.08.003","volume":"128","author":"C-H Liu","year":"2018","unstructured":"C.-H. Liu and S. Oum: Partitioning H-minor free graphs into three subgraphs with no large components, J. Combin. Theory Ser. B 128 (2018) 114\u2013133.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3848_CR14","volume-title":"Springer","author":"J Ne\u0161et\u0159il","year":"2012","unstructured":"J. Ne\u0161et\u0159il and P. Ossona de Mendez: Sparsity, vol. 28 of Algorithms and Combinatorics, Springer, 2012."},{"key":"3848_CR15","volume-title":"Conquering graphs of bounded treewidth","author":"S Norin","year":"2015","unstructured":"S. Norin: Conquering graphs of bounded treewidth, 2015, Unpublished manuscript."},{"key":"3848_CR16","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s00493-018-3733-1","volume":"39","author":"P Ossona de Mendez","year":"2019","unstructured":"P. Ossona de Mendez, S. Oum and D. R. Wood: Defective colouring of graphs excluding a subgraph or minor, Combinatorica 39 (2019), 377\u2013410.","journal-title":"Combinatorica"},{"key":"3848_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.dam.2016.12.025","volume":"231","author":"J-F Raymond","year":"2017","unstructured":"J.-F. Raymond and D. M. Thilikos: Recent techniques and results on the Erd\u0151s-P\u00f3sa property, Discrete Appl. Math. 231 (2017), 25\u201343.","journal-title":"Discrete Appl. Math."},{"key":"3848_CR18","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N Robertson","year":"1986","unstructured":"N. Robertson and P. Seymour: Graph minors. V. Excluding a planar graph, J. Combin. Theory Ser. B 41 (1986), 92\u2013114.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3848_CR19","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF01202354","volume":"13","author":"N Robertson","year":"1993","unstructured":"N. Robertson, P. Seymour and R. Thomas: Hadwiger\u2019s conjecture for K6-free graphs, Combinatorica 13 (1993), 279\u2013361.","journal-title":"Combinatorica"},{"key":"3848_CR20","first-page":"417","volume-title":"Open Problems in Mathematics","author":"P Seymour","year":"2015","unstructured":"P. Seymour: Hadwiger\u2019s conjecture, in: John Forbes Nash Jr. and Michael Th. Rassias, eds., Open Problems in Mathematics, 417\u2013437, Springer, 2015."},{"key":"3848_CR21","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":"3848_CR22","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":"3848_CR23","doi-asserted-by":"publisher","first-page":"2102","DOI":"10.1016\/j.ejc.2010.05.015","volume":"31","author":"D R Wood","year":"2010","unstructured":"D. R. Wood: Contractibility and the Hadwiger conjecture, European J. Combin. 31 (2010), 2102\u20132109.","journal-title":"European J. Combin."},{"key":"3848_CR24","volume-title":"Electron. J. Combin.","author":"D R Wood","year":"2018","unstructured":"D. R. Wood: Defective and clustered graph colouring, Electron. J. Combin., #DS23, 2018."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-019-3848-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-019-3848-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-019-3848-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,27]],"date-time":"2020-10-27T00:23:08Z","timestamp":1603758188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-019-3848-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,28]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["3848"],"URL":"https:\/\/doi.org\/10.1007\/s00493-019-3848-z","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,28]]},"assertion":[{"value":"8 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}