Some remarks on the odd hadwiger's conjecture

Combinatorica

Volumn 27, Issue 4, 2007, Pages 429-438

  Kawarabayashi, Ken Ichi ^a   Song, Zi Xia ^b,c  

^a TOHOKU UNIVERSITY   (Japan)

^b OHIO STATE UNIVERSITY   (United States)

^c UNIVERSITY OF CENTRAL FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 44449146026     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-007-2213-9     Document Type: Article

References (25)

1. K. Appel and W. Haken: Every planar map is four colorable, Part I. Discharging; Illinois J. Math. 21 (1977), 429-490.
2. K. Appel, W. Haken and J. Koch: Every planar map is four colorable, Part II. Reducibility; Illinois J. Math. 21 (1977), 491-567.
3. T. Böhme, K. Kawarabayashi, J. Maharry and B. Mohar: Linear connectivity forces large complete bipartite minors, to appear in J. Combin. Theory Ser. B.
4. P. A. Catlin: A bound on the chromatic number of a graph, Discrete Math 22 (1978), 81-83.
5. R. Diestel: Graph Theory, Graduate texts in mathematics 173, Springer (1997).
6. G. A. Dirac: A property of 4-chromatic graphs and some remarks on critical graphs, J. London Math. Soc. 27 (1952), 85-92.
7. P. Duchet and H. Meyniel: On Hadwiger's number and the stability number, Annals of Discrete Math. 13 (1982), 71-74.
8. H. Hadwiger: Über eine Klassifikation der Streckenkomplexe, Vierteljahrsschr. Naturforsch, Ges. Zürich 88 (1943), 133-142.
9. J. Geelen, B. Gerards, L. Goddyn, B. Reed, P. Seymour and A. Vetta: The odd case of Hadwiger's conjecture, submitted.
10. B. Guenin: Talk at Oberwolfach on Graph Theory, Jan. 2005.
11. T. R. Jensen and B. Toft: Graph Coloring Problems, Wiley-Interscience, 1995.
12. K. Kawarabayashi: Minors in 7-chromatic graphs, preprint.
13. 4,4 as a minor, Combinatorica 25(3) (2005), 327-353.
14. K. Kawarabayashi, M. Plummer and B. Toft: Improvements of the theorem of Duchet and Meyniel on Hadwiger's Conjecture, J. Combin. Theory Ser. B 95 (2005), 152-167.
15. K. Kawarabayashi and Z. Song: Independence number and clique minors, submitted.
16. A. Kostochka: The minimum Hadwiger number for graphs with a given mean degree of vertices (in Russian), Metody Diskret. Analiz. 38 (1982), 37-58.
17. A. Kostochka: Lower bound of the Hadwiger number of graphs by their average degree, Combinatorica 4 (1984), 307-316.
18. M. D. Plummer, M. Stiebitz and B. Toft: On a special case of Hadwiger's Conjecture, Discuss. Math. Graph Theory 23 (2003), 333-363.
19. B. Reed and P. D. Seymour: Fractional colouring and Hadwiger's conjecture, J. Combin. Theory Ser. B 74 (1998), 147-152.
20. N. Robertson, D. P. Sanders, P. D. Seymour and R. Thomas: The four-color theorem, J. Combin. Theory Ser. B 70 (1997), 2-44.
21. 6-free graphs, Combinatorica 13 (1993), 279-361.
22. A. Thomason: An extremal function for contractions of graphs, Math. Proc. Cambridge Philos. Soc. 95 (1984), 261-265.
23. A. Thomason: The extremal function for complete minors, J. Combin. Theory Ser. B 81 (2001), 318-338.
24. K. Wagner: Über eine Eigenschaft der ebenen Komplexe, Math. Ann. 114 (1937), 570-590.
25. D. R. Woodall: Subcontraction-equivalence and Hadwiger's Conjecture, J. Graph Theory 11 (1987), 197-204.