{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T16:44:50Z","timestamp":1780505090525,"version":"3.54.1"},"publisher-location":"Cham","reference-count":86,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319321608","type":"print"},{"value":"9783319321622","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32162-2_13","type":"book-chapter","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T10:20:27Z","timestamp":1467714027000},"page":"417-437","source":"Crossref","is-referenced-by-count":26,"title":["Hadwiger\u2019s Conjecture"],"prefix":"10.1007","author":[{"given":"Paul","family":"Seymour","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,7,6]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"F. N. Abu-Khzam and M. A. Langston, \u201cGraph coloring and the immersion order\u201d, Computing and Combinatorics, Lecture Notes in Comput. Sci. 2697 (2003) (Springer, Berlin) 394\u2013403.","DOI":"10.1007\/3-540-45071-8_40"},{"key":"13_CR2","unstructured":"B. Albar and D. Gon\u00e7alves, \u201cOn triangles in K r -minor free graphs\u201d, submitted for publication (manuscript April 2013), http:\/\/arXiv.org\/abs\/1304.5468 ."},{"key":"13_CR3","doi-asserted-by":"crossref","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, \u201cPartitioning into graphs with only small components\u201d, J. Combinatorial Theory, Ser. B, 87 (2003), 231\u2013243.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1215\/ijm\/1256049011","volume":"21","author":"K. Appel","year":"1977","unstructured":"K. Appel and A. Haken, \u201cEvery planar map is four colorable. Part I. Discharging\u201d, Illinois J. Math. 21 (1977), 429\u2013490.","journal-title":"Illinois J. Math."},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1215\/ijm\/1256049012","volume":"21","author":"K. Appel","year":"1977","unstructured":"K. Appel, A. Haken and J. Koch, \u201cEvery planar map is four colorable. Part II. Reducibility\u201d, Illinois J. Math. 21 (1977), 491\u2013567.","journal-title":"Illinois J. Math."},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"2203","DOI":"10.1016\/j.disc.2011.07.003","volume":"311","author":"J. Balogh","year":"2011","unstructured":"J. Balogh and A. V. Kostochka, \u201cLarge minors in graphs with given independence number\u201d, Discrete Math. 311 (2011), 2203\u20132215.","journal-title":"Discrete Math."},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"p232","DOI":"10.37236\/719","volume":"18","author":"J. Bar\u00e1t","year":"2011","unstructured":"J. Bar\u00e1t, G. Joret and D. R. Wood, \u201cDisproof of the list Hadwiger conjecture\u201d, Electronic Journal of Combinatorics 18 (2011), p232.","journal-title":"Electronic Journal of Combinatorics"},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/j.jctb.2008.07.006","volume":"99","author":"T. B\u00f6hme","year":"2009","unstructured":"T. B\u00f6hme, K. Kawarabayashi, J. Maharry and B. Mohar, \u201cLinear connectivity forces large complete bipartite graph minors\u201d, J. Combinatorial Theory, Ser. B, 99 (2009), 557\u2013582.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"13_CR9","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1017\/S0963548311000174","volume":"20","author":"T. B\u00f6hme","year":"2011","unstructured":"T. B\u00f6hme, A. Kostochka and A. Thomason, \u201cMinors in graphs with high chromatic number\u201d, Combin. Probab. Comput. 20 (2011), 513\u2013518.","journal-title":"Combin. Probab. Comput."},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0195-6698(80)80001-1","volume":"1","author":"B. Bollob\u00e1s","year":"1980","unstructured":"B. Bollob\u00e1s, P. A. Catlin and P. Erd\u0151s, \u201cHadwiger\u2019s conjecture is true for almost every graph\u201d, Europ. J. Combinatorics 1 (1980), 195\u2013199.","journal-title":"Europ. J. Combinatorics"},{"key":"13_CR11","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0012-365X(93)90532-X","volume":"121","author":"M. Borowiecki","year":"1993","unstructured":"M. Borowiecki, \u201cResearch problem 172\u201d, Discrete Mathematics 121 (1993), 235\u2013236.","journal-title":"Discrete Mathematics"},{"key":"13_CR12","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1016\/0095-8956(79)90062-5","volume":"26","author":"P. Catlin","year":"1979","unstructured":"P. Catlin, \u201cHaj\u00f3s\u2019 graph-coloring conjecture: Variations and counterexamples,\u201d J. Combinatorial Theory, Ser. B, 26 (1979), 268\u2013274.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1002\/jgt.20425","volume":"63","author":"M. Chudnovsky","year":"2010","unstructured":"M. Chudnovsky and A. Fradkin, \u201cAn approximate version of Hadwiger\u2019s conjecture for claw-free graphs\u201d, J. Graph Theory 63 (2010), 259\u2013278.","journal-title":"J. Graph Theory"},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.jctb.2010.09.001","volume":"101","author":"M. Chudnovsky","year":"2011","unstructured":"M. Chudnovsky, B. Reed and P. Seymour, \u201cThe edge-density for K 2, t minors\u201d, J. Combinatorial Theory, Ser. B, 101 (2011), 18\u201346.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s00493-012-2594-2","volume":"32","author":"M. Chudnovsky","year":"2012","unstructured":"M. Chudnovsky and P. Seymour, \u201cPacking seagulls\u201d, Combinatorica, 32 (2012), 251\u2013282.","journal-title":"Combinatorica"},{"key":"13_CR16","doi-asserted-by":"crossref","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, B. Reed, D. Sanders, P. Seymour and D. Vertigan, \u201cExcluding any graph as a minor allows a low tree-width 2-coloring\u201d, J. Combinatorial Theory, Ser. B, 91 (2004), 25\u201341.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"13_CR17","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s00493-014-2806-z","volume":"34","author":"M. DeVos","year":"2014","unstructured":"M. DeVos, Z. Dvo\u0159\u00e9k, J. Fox, J. McDonald, B. Mohar and D. Scheide, \u201cA minimum degree condition forcing complete graph immersion\u201d, Combinatorica 34 (2014), 279\u2013298.","journal-title":"Combinatorica"},{"key":"13_CR18","doi-asserted-by":"crossref","first-page":"139","DOI":"10.26493\/1855-3974.112.b74","volume":"3","author":"M. DeVos","year":"2010","unstructured":"M. DeVos, K. Kawarabayashi, B. Mohar and H. Okamura, \u201cImmersing small complete graphs\u201d, Ars Mathematica Contemporanea 3 (2010), 139\u2013146.","journal-title":"Ars Mathematica Contemporanea"},{"key":"13_CR19","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1017\/S0963548310000076","volume":"19","author":"G. Ding","year":"2010","unstructured":"G. Ding and S. Dziobiak, \u201cVertex-bipartition method for colouring minor-closed classes of graphs\u201d, Combinatorics, Probability and Computing 19 (2010), 579\u2013591.","journal-title":"Combinatorics, Probability and Computing"},{"key":"13_CR20","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1002\/jgt.1013","volume":"37","author":"G. Ding","year":"2001","unstructured":"G. Ding, T. Johnson and P. Seymour, \u201cSpanning trees with many leaves\u201d, J. Graph Theory, 37 (2001), 189\u2013197.","journal-title":"J. Graph Theory"},{"key":"13_CR21","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/jctb.2000.1962","volume":"79","author":"G. Ding","year":"2000","unstructured":"G. Ding, B. Oporowski, D. Sanders, and D. Vertigan, \u201cSurfaces, tree-width, clique-minors, and partitions\u201d, J. Combinatorial Theory, Ser. B, 79 (2000), 221\u2013246.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"13_CR22","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1112\/jlms\/s1-27.1.85","volume":"27","author":"G. A. Dirac","year":"1952","unstructured":"G. A. Dirac, \u201cA property of 4-chromatic graphs and some remarks on critical graphs\u201d, J. London Math. Soc. 27 (1952), 85\u201392.","journal-title":"J. London Math. Soc."},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"P. Duchet and H. Meyniel, \u201cOn Hadwiger\u2019s number and the stability number\u201d, in Graph Theory (Proc. conf. on graph theory, Cambridge, 1981; B. Bollob\u00e1s, ed.), Annals of Discrete Math. 13, North-Holland, Amsterdam, New York, 71\u201373; North-Holland Mathematical Studies 62 (1982), 71\u201373.","DOI":"10.1016\/S0304-0208(08)73549-7"},{"key":"13_CR24","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"R.J. Duffin","year":"1965","unstructured":"R.J. Duffin, \u201cTopology of series\u2013parallel networks\u201d, J. Math. Analys. Appl. 10 (1965), 303\u2013318.","journal-title":"J. Math. Analys. Appl."},{"key":"13_CR25","unstructured":"Zden\u011bk Dvo\u0159\u00e1k and Liana Yepremyan, \u201cComplete graph immersions and minimum degree\u201d, http:\/\/arxiv.org\/abs\/1512.00513 ."},{"key":"13_CR26","doi-asserted-by":"crossref","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, \u201cA relative of Hadwiger\u2019s conjecture\u201d, SIAM J. Discrete Math. 29 (2015), 2385\u20132388.","journal-title":"SIAM J. Discrete Math."},{"key":"13_CR27","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02579269","volume":"1","author":"P. Erd\u0151s","year":"1981","unstructured":"P. Erd\u0151s and S. Fajtlowicz, \u201cOn the conjecture of Haj\u00f3s\u201d, Combinatorica 1 (1981), 141\u2013143.","journal-title":"Combinatorica"},{"key":"13_CR28","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0012-365X(83)90280-7","volume":"46","author":"W. Fernandez de la Vega","year":"1983","unstructured":"W. Fernandez de la Vega, \u201cOn the maximum density of graphs which have no subcontraction to K s \u201d, Discrete Math. 46 (1983), 109\u2013110.","journal-title":"Discrete Math."},{"key":"13_CR29","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1137\/090766814","volume":"24","author":"J. Fox","year":"2010","unstructured":"J. Fox, \u201cComplete minors and independence number\u201d, SIAM J. Discrete Math. 24 (2010), 1313\u20131321.","journal-title":"SIAM J. Discrete Math."},{"key":"13_CR30","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s00493-013-2853-x","volume":"33","author":"J. Fox","year":"2013","unstructured":"J. Fox, C. Lee and B. Sudakov, \u201cChromatic number, clique subdivisions, and the conjectures of Haj\u00f3s and Erd\u0151s-Fajtlowicz\u201d, Combinatorica 33 (2013), 181\u2013197.","journal-title":"Combinatorica"},{"key":"13_CR31","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.jctb.2011.04.005","volume":"102","author":"A. Fradkin","year":"2012","unstructured":"A. Fradkin, \u201cClique minors in claw-free graphs\u201d, J. Combinatorial Theory, Ser. B, 102 (2012), 71\u201385.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"13_CR32","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.jctb.2008.03.006","volume":"99","author":"J. Geelen","year":"2009","unstructured":"J. Geelen, A. Gerards, B. Reed, P. Seymour and A. Vetta, \u201cOn the odd-minor variant of Hadwiger\u2019s conjecture\u201d, J. Combinatorial Theory, Ser B, 99 (2009), 20\u201329.","journal-title":"J. Combinatorial Theory, Ser B"},{"key":"13_CR33","unstructured":"A. M. H. Gerards, Graphs and polyhedra. Binary spaces and cutting planes, volume 73 of CWI Tract. Stichting Mathematisch Centrum voor Wiskunde en Informatica, Amsterdam, 1990; http:\/\/oai.cwi.nl\/oai\/asset\/12714\/12714A.pdf ."},{"key":"13_CR34","doi-asserted-by":"crossref","unstructured":"D. Gon\u00e7alves, \u201cOn vertex partitions and some minor-monotone graph parameters\u201d, J. Graph Theory 66 (2011), 49\u201356.","DOI":"10.1002\/jgt.20490"},{"key":"13_CR35","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1017\/S0305004100051124","volume":"77","author":"G. R. Grimmitt","year":"1975","unstructured":"G. R. Grimmitt and C. J. H. McDiarmid, \u201cOn colouring random graphs\u201d, Math. Proc. Cambridge Phil. Soc. 77 (1975), 313\u2013324.","journal-title":"Math. Proc. Cambridge Phil. Soc."},{"key":"13_CR36","unstructured":"B. Guenin, \u201cGraphs without odd-K5 minors are 4-colourable\u201d, in preparation."},{"key":"13_CR37","first-page":"133","volume":"88","author":"H. Hadwiger","year":"1943","unstructured":"H. Hadwiger, \u201c\u00dcber eine Klassifikation der Streckenkomplexe\u201d, Vierteljschr. Naturforsch. Ges. Z\u00fcrich 88 (1943), 133\u2013143.","journal-title":"Vierteljschr. Naturforsch. Ges. Z\u00fcrich"},{"key":"13_CR38","first-page":"115","volume-title":"Graph Coloring Problems","author":"T. Jensen","year":"1995","unstructured":"T. Jensen and B. Toft, Graph Coloring Problems, Wiley, Chichester UK, 1995, page 115."},{"key":"13_CR39","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1002\/jgt.3190180502","volume":"18","author":"L. J\u00f8rgensen","year":"1994","unstructured":"L. J\u00f8rgensen, \u201cContractions to K 8\u201d, J. Graph Theory 18 (1994), 431\u2013448.","journal-title":"J. Graph Theory"},{"key":"13_CR40","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1017\/S0963548308009462","volume":"17","author":"K. Kawarabayashi","year":"2008","unstructured":"K. Kawarabayashi, \u201cA weakening of the odd Hadwiger\u2019s conjecture\u201d, Combinatorics, Probability and Computing 17 (2008), 815\u2013821.","journal-title":"Combinatorics, Probability and Computing"},{"key":"13_CR41","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1016\/j.jctb.2008.12.001","volume":"99","author":"K. Kawarabayashi","year":"2009","unstructured":"K. Kawarabayashi, \u201cNote on coloring graphs without odd-K k -minors\u201d, J. Combinatorial Theory, Ser. B, 99 (2009), 728\u2013731.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"13_CR42","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.jctb.2006.04.004","volume":"97","author":"K. Kawarabayashi","year":"2007","unstructured":"K. Kawarabayashi, \u201cOn the connectivity of minimum and minimal counterexamples to Hadwiger\u2019s conjecture\u201d, J. Combinatorial Theory, Ser. B, 97 (2007), 144\u2013150.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"13_CR43","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/j.jctb.2006.11.002","volume":"97","author":"K. Kawarabayashi","year":"2007","unstructured":"K. Kawarabayashi and B. Mohar, \u201cA relaxed Hadwiger\u2019s conjecture for list colorings\u201d, J. Combinatorial Theory Ser. B, 97 (2007), 647\u2013651.","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"13_CR44","unstructured":"K. Kawarabayashi, S. Norin, R. Thomas and P. Wollan, \u201cK 6 minors in large 6-connected graphs\u201d, in preparation; http:\/\/arXiv.org\/abs\/1203.2192 ."},{"key":"13_CR45","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/j.ejc.2007.02.010","volume":"29","author":"K. Kawarabayashi","year":"2008","unstructured":"K. Kawarabayashi and B. Reed, \u201cFractional coloring and the odd Hadwiger\u2019s conjecture\u201d, European J. Comb. 29 (2008), 411\u2013417.","journal-title":"European J. Comb."},{"key":"13_CR46","doi-asserted-by":"crossref","unstructured":"K. Kawarabayashi and B. Reed, \u201cHadwiger\u2019s conjecture is decidable\u201d, Proc. 41st Annual ACM Symposium on Theory of Computing, STOC 2009, 445\u2013454.","DOI":"10.1145\/1536414.1536476"},{"key":"13_CR47","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s00493-007-2213-9","volume":"27","author":"K. Kawarabayashi","year":"2007","unstructured":"K. Kawarabayashi and Z. Song, \u201cSome remarks on the odd Hadwiger\u2019s conjecture\u201d, Combinatorica, 27 (2007), 429\u2013438.","journal-title":"Combinatorica"},{"key":"13_CR48","doi-asserted-by":"crossref","unstructured":"A. V. Kostochka, \u201cK s, t minors in (s + t)-chromatic graphs, II\u201d, J. Graph Theory 75 (2014), 377\u2013386.","DOI":"10.1002\/jgt.21744"},{"key":"13_CR49","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02579141","volume":"4","author":"A. V. Kostochka","year":"1984","unstructured":"A. V. Kostochka, \u201cLower bound on the Hadwiger number of graphs by their average degree\u201d, Combinatorica 4 (1984), 307\u2013316.","journal-title":"Combinatorica"},{"key":"13_CR50","doi-asserted-by":"crossref","unstructured":"A. V. Kostochka, \u201cOn K s, t minors in (s + t)-chromatic graphs\u201d, J. Graph Theory 65 (2010), 343\u2013350.","DOI":"10.1002\/jgt.20485"},{"key":"13_CR51","unstructured":"A. V. Kostochka, \u201cThe minimum Hadwiger number for graphs with a given mean degree of vertices\u201d, Metody Diskret. Analiz. 38 (1982), 37\u201358; AMS Translations (2), 132 (1986), 15\u201332."},{"key":"13_CR52","doi-asserted-by":"crossref","first-page":"2637","DOI":"10.1016\/j.disc.2010.03.026","volume":"310","author":"A. V. Kostochka","year":"2010","unstructured":"A. V. Kostochka and N. Prince, \u201cDense graphs have K 3, t minors\u201d, Discrete Math. 310 (2010), 2637\u20132654.","journal-title":"Discrete Math."},{"key":"13_CR53","doi-asserted-by":"crossref","unstructured":"A. V. Kostochka and N. Prince, \u201cOn K s, t minors in graphs of given average degree\u201d, Discrete Math. 308 (2008), 4435\u20134445.","DOI":"10.1016\/j.disc.2007.08.041"},{"key":"13_CR54","doi-asserted-by":"crossref","unstructured":"A. V. Kostochka and N. Prince, \u201cOn K s, t -minors in graphs with given average degree, II\u201d, Discrete Math. 312 (2012), 3517\u20133522.","DOI":"10.1016\/j.disc.2012.08.004"},{"key":"13_CR55","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.ejc.2004.02.002","volume":"26","author":"D. K\u00fchn","year":"2005","unstructured":"D. K\u00fchn and D. Osthus, \u201cForcing complete unbalanced bipartite minors\u201d, Europ. J. Combinatorics 26 (2005), 75\u201381.","journal-title":"Europ. J. Combinatorics"},{"key":"13_CR56","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"K. Kuratowski","year":"1930","unstructured":"K. Kuratowski, \u201cSur le probl\u00e8me des courbes gauches en topologie\u201d, Fund. Math. 15 (1930), 271\u2013283.","journal-title":"Fund. Math."},{"key":"13_CR57","doi-asserted-by":"crossref","unstructured":"F. Lescure and H. Meyniel, \u201cOn a problem upon configurations contained in graphs with given chromatic number\u201d, Graph Theory in Memory of G. A. Dirac (Sandbjerg, 1985), Ann. Discrete Math. 41, North-Holland, Amsterdam, 1989, 325\u2013331.","DOI":"10.1016\/S0167-5060(08)70470-9"},{"key":"13_CR58","unstructured":"C. Liu and S. Oum, \u201cPartitioning H-minor free graphs into three subgraphs with no large components\u201d, manuscript March 2015; http:\/\/arXiv.org\/abs\/1503.08371v1 ."},{"key":"13_CR59","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01364272","volume":"174","author":"W. Mader","year":"1967","unstructured":"W. Mader, \u201cHomomorphieeigenschaften und mittlere Kantendichte von Graphen\u201d Math. Ann. 174 (1967), 265\u2013268.","journal-title":"Math. Ann."},{"key":"13_CR60","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/BF01350657","volume":"178","author":"W. Mader","year":"1968","unstructured":"W. Mader, \u201cHomomorphies\u00e4tze f\u00fcr Graphen\u201d, Math. Ann., 178 (1968), 154\u2013168.","journal-title":"Math. Ann."},{"key":"13_CR61","first-page":"245","volume":"175","author":"W. Mader","year":"1968","unstructured":"W. Mader, \u201c\u00dcber trennende Eckenmengen in homomorphiekritischen Graphen\u201d, Math. Ann. 175 (1968), 245\u2013252.","journal-title":"Math. Ann."},{"key":"13_CR62","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0012-365X(03)00051-7","volume":"271","author":"J.S. Myers","year":"2003","unstructured":"J.S. Myers, \u201cThe extremal function for unbalanced bipartite minors\u201d, Discrete Math. 271 (2003), 209\u2013222.","journal-title":"Discrete Math."},{"key":"13_CR63","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1007\/s00493-005-0044-0","volume":"25","author":"J. S. Myers","year":"2005","unstructured":"J. S. Myers and A. Thomason, \u201cThe extremal function for noncomplete minors\u201d, Combinatorica 25 (2005), 725\u2013753.","journal-title":"Combinatorica"},{"key":"13_CR64","unstructured":"S. Norin, \u201cConquering graphs of bounded treewidth\u201d, unpublished manuscript, April 2015."},{"key":"13_CR65","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1006\/jctb.1998.1835","volume":"74","author":"B. Reed","year":"1998","unstructured":"B. Reed and P. Seymour, \u201cFractional colouring and Hadwiger\u2019s conjecture\u201d, J. Combinatorial Theory, Ser. B, 74 (1998), 147\u2013152.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"13_CR66","first-page":"873","volume":"25","author":"B. Reed","year":"2004","unstructured":"B. Reed and P. Seymour, \u201cHadwiger\u2019s conjecture for line graphs\u201d, European J. Math., 25 (2004), 873\u2013876.","journal-title":"European J. Math."},{"key":"13_CR67","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1017\/S0963548315000073","volume":"25","author":"B. Reed","year":"2016","unstructured":"B. Reed and D. Wood, \u201cForcing a sparse minor\u201d, Combinatorics, Probability and Computing, 25 (2016), 300\u2013322.","journal-title":"Combinatorics, Probability and Computing"},{"key":"13_CR68","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0095-8956(03)00042-X","volume":"89","author":"N. Robertson","year":"2003","unstructured":"N. Robertson and P. Seymour, \u201cGraph minors. XVI. Excluding a non-planar graph\u201d, J. Combinatorial Theory, Ser. B, 89 (2003), 43\u201376.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"13_CR69","doi-asserted-by":"crossref","unstructured":"N. Robertson, P. Seymour and R. Thomas, \u201cExcluding infinite clique minors\u201d, Memoirs Amer. Math. Soc., no. 566, vol. 118 (1995).","DOI":"10.1090\/memo\/0566"},{"key":"13_CR70","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1090\/S0002-9947-1992-1079057-3","volume":"332","author":"N. Robertson","year":"1992","unstructured":"N. Robertson, P. Seymour and R. Thomas, \u201cExcluding subdivisions of infinite cliques\u201d, Trans. Amer. Math. Soc. 332 (1992), 211\u2013223.","journal-title":"Trans. Amer. Math. Soc."},{"key":"13_CR71","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01202354","volume":"13","author":"N. Robertson","year":"1993","unstructured":"N. Robertson, P. Seymour and R. Thomas, \u201cHadwiger\u2019s conjecture for K 6-free graphs\u201d, Combinatorica 13 (1993), 279\u2013361.","journal-title":"Combinatorica"},{"key":"13_CR72","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/j.jctb.2005.07.008","volume":"96","author":"Z. Song","year":"2006","unstructured":"Z. Song and R. Thomas, \u201cThe extremal function for K 9 minors\u201d, J. Combinatorial Theory, Ser. B, 96 (2006), 240\u2013252.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"13_CR73","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1017\/S0305004100061521","volume":"95","author":"A. Thomason","year":"1984","unstructured":"A. Thomason, \u201cAn extremal function for contractions of graphs\u201d, Math. Proc. Camb. Phil. Soc. 95 (1984), 261\u2013265.","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"13_CR74","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1006\/jctb.2000.2013","volume":"81","author":"A. Thomason","year":"2001","unstructured":"A. Thomason, \u201cThe extremal function for complete minors\u201d, J. Combinatorial Theory Ser. B, 81 (2001), 318\u2013338.","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"13_CR75","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1006\/jctb.1994.1062","volume":"62","author":"C. Thomassen","year":"1994","unstructured":"C. Thomassen, \u201cEvery planar graph is 5-choosable\u201d, J. Combinatorial Theory, Ser. B, 62 (1994), 180\u2013181.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"13_CR76","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s004930100006","volume":"21","author":"C. Thomassen","year":"2001","unstructured":"C. Thomassen, \u201cTotally odd K 4-subdivisions in 4-chromatic graphs\u201d, Combinatorica 21 (2001), 417\u2013443.","journal-title":"Combinatorica"},{"key":"13_CR77","unstructured":"B. Toft, \u201cProblem 10,\u201d in Recent Advances in Graph Theory, Proc. Symp. Prague June 1974, M. Fiedler (Ed.), Academia Praha, 1975, 543\u2013544."},{"key":"13_CR78","unstructured":"B. Toft, A Survey of Hadwiger\u2019s Conjecture, in: Surveys in Graph Theory (edited by G. Chartrand and M. Jacobson), Congr. Numer. 115 (1996), 249\u2013283."},{"key":"13_CR79","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0021-9800(66)80004-2","volume":"1","author":"W. T. Tutte","year":"1966","unstructured":"W. T. Tutte, \u201cOn the algebraic theory of graph colorings\u201d, J. Combinatorial Theory, 1 (1966), 15\u201350.","journal-title":"J. Combinatorial Theory"},{"key":"13_CR80","doi-asserted-by":"crossref","first-page":"84","DOI":"10.15764\/AM.2014.02008","volume":"1","author":"D. Zypen van der","year":"2014","unstructured":"D. van der Zypen, \u201cA weak form of Hadwiger\u2019s conjecture\u201d SOP Trans. Appl. Math. 1 (2014), 84\u201387.","journal-title":"SOP Trans. Appl. Math."},{"key":"13_CR81","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(93)90579-I","volume":"120","author":"M. Voigt","year":"1993","unstructured":"M. Voigt, \u201cList colourings of planar graphs\u201d, Discrete Mathematics 120 (1993), 215\u2013219.","journal-title":"Discrete Mathematics"},{"key":"13_CR82","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01361181","volume":"153","author":"K. Wagner","year":"1964","unstructured":"K. Wagner, \u201cBeweis einer Abschw\u00e4chung der Hadwiger-Vermutung\u201d, Math. Ann. 153 (1964), 139\u2013141.","journal-title":"Math. Ann."},{"key":"13_CR83","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1007\/BF01594196","volume":"114","author":"K. Wagner","year":"1937","unstructured":"K. Wagner, \u201c\u00dcber eine Eigenschaft der ebenen Komplexe\u201d, Math. Ann. 114 (1937), 570\u2013590.","journal-title":"Math. Ann."},{"key":"13_CR84","doi-asserted-by":"crossref","first-page":"2102","DOI":"10.1016\/j.ejc.2010.05.015","volume":"31","author":"D. R. Wood","year":"2010","unstructured":"D. R. Wood, \u201cContractibility and the Hadwiger conjecture\u201d, Europ. J. Combinatorics., 31 (2010), 2102\u20132109.","journal-title":"Europ. J. Combinatorics."},{"key":"13_CR85","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1016\/j.ejc.2008.11.010","volume":"30","author":"D. R. Wood","year":"2009","unstructured":"D. R. Wood, \u201cOn tree-partition-width\u201d, European J. Combinatorics 30 (2009), 1245\u20131253.","journal-title":"European J. Combinatorics"},{"key":"13_CR86","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1023\/A:1009784115916","volume":"2","author":"W. Zang","year":"1998","unstructured":"W. Zang, \u201cProof of Toft\u2019s conjecture: every graph containing no fully odd K 4 is 3-colorable\u201d, J. Combinatorial Optimization 2 (1998), 117\u2013199.","journal-title":"J. Combinatorial Optimization"}],"container-title":["Open Problems in Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32162-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T03:29:39Z","timestamp":1718681379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32162-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319321608","9783319321622"],"references-count":86,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32162-2_13","relation":{},"subject":[],"published":{"date-parts":[[2016]]}}}