On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture

Journal of Combinatorial Theory. Series B

Volumn 97, Issue 1, 2007, Pages 144-150

  Kawarabayashi, Ken ichi ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

Connectivity; Contraction critical graphs; Hadwiger's Conjecture

Indexed keywords

EID: 37849185916     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2006.04.004     Document Type: Article

References (25)

1. Appel K., and Haken W. Every planar map is four colorable, Part I. Discharging. Illinois J. Math. 21 (1977) 429-490
2. Appel K., Haken W., and Koch J. Every planar map is four colorable, Part II. Reducibility. Illinois J. Math. 21 (1977) 491-567
3. T. Böhme, K. Kawarabayashi, J. Maharry, B. Mohar, Linear connectivity forces large complete bipartite graph minors, preprint
4. Bollobás B., and Thomason A. Highly linked graphs. Combinatorica 16 (1996) 313-320
5. Chartrand G., Geller D.P., and Hedetniemi T. Graphs with forbidden subgraphs. J. Combin. Theory Ser. B 10 (1971) 12-41
6. Diestel R. Graph Theory. Grad. Texts in Math. vol. 173 (1997), Springer
7. Dirac G.A. A property of 4-chromatic graphs and some remarks on critical graphs. J. London Math. Soc. 27 (1952) 85-92
8. Dirac G.A. Trennende Knotenpunktmengen und Reduzibilität abstrakter Graphen mit Anwendung auf das Vierfarbenproblem. J. Reine Angew. Math. 204 (1960) 116-131
9. Dirac G.A. On the structure of 5- and 6-chromatic abstract graphs. J. Reine Angew. Math. 214/215 (1964) 43-52
10. Egawa Y., Faudree R., Györi E., Ishigami Y., Schelp R., and Wang H. Vertex-disjoint cycles containing specified edges. Graphs Combin. 16 (2000) 81-92
11. Hadwiger H. Über eine Klassifikation der Streckenkomplexe. Vierteljahrsschr. Naturforsch. Ges. Zürich 88 (1943) 133-142
12. K. Kawarabayashi, Minors in 7-chromatic graphs, preprint
13. 4, 4 as a minor. Combinatorica 25 (2005) 327-353
14. Kawarabayashi K., and Wollan P. Non-zero disjoint cycles in highly connected group labelled graphs. J. Combin. Theory Ser. B 96 (2006) 296-301
15. K. Kawarabayashi, A. Kostochka, G. Yu, On sufficient degree conditions for a graph to be k-linked, Combin. Probab. Comput., in press
16. Mader W. Über trennende Eckenmengen in homomorphiekritischen Graphen. Math. Ann. 175 (1968) 243-252
17. Mader W. Existenz n-fach zusammenhängender teilgraphen in graphen genügend grossen kantendichte. Abh. Math. Sem. Univ. Hamburg 37 (1972) 86-97
18. Robertson N., and Seymour P. Graph minors XIII, The disjoint paths problem. J. Combin. Theory Ser. B 63 (1995) 65-100
19. Robertson N., and Seymour P. Graph minors XX, Wagner's conjecture. J. Combin. Theory Ser. B 92 (2004) 325-357
20. 6-free graphs. Combinatorica 13 (1993) 279-361
21. Robertson N., Sanders D.P., Seymour P.D., and Thomas R. The four-color theorem. J. Combin. Theory Ser. B 70 (1997) 2-44
22. Thomas R., and Wollan P. An improved linear edge bound for graph linkages. European J. Combin. 26 (2005) 309-324
23. Toft B. On separating sets of edges in contraction-critical graphs. Math. Ann. 196 (1972) 129-147
24. Wagner K. Über eine Eigenschaft der ebenen Komplexe. Math. Ann. 114 (1937) 570-590
25. Woodall D.R. Improper colourings of graphs. In: Nelson R., and Wilson R.J. (Eds). Graph Colourings. Pitman Res. Notes vol. 218 (1990), Longman 45-63