Hadwiger's conjecture forK6-free graphs

@article{Robertson1993HadwigersCF,
  title={Hadwiger's conjecture forK6-free graphs},
  author={N. Robertson and P. Seymour and Robin Thomas},
  journal={Combinatorica},
  year={1993},
  volume={13},
  pages={279-361}
}
In 1943, Hadwiger made the conjecture that every loopless graph not contractible to the complete graph ont+1 vertices ist-colourable. Whent≤3 this is easy, and whent=4, Wagner's theorem of 1937 shows the conjecture to be equivalent to the four-colour conjecture (the 4CC). However, whent≥5 it has remained open. Here we show that whent=5 it is also equivalent to the 4CC. More precisely, we show (without assuming the 4CC) that every minimal counterexample to Hadwiger's conjecture whent=5 is “apex… Expand

Topics from this paper

Matchings and Hadwiger's Conjecture
Hadwiger's conjecture is decidable
Hadwiger's conjecture for squares of 2-trees
A special case of Hadwiger's conjecture
  • J. Blasiak
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 2007
Hadwiger conjecture for 8-coloring graph
Improper colourings inspired by Hadwiger's conjecture
Any 7-Chromatic Graphs Has K7 Or K4,4 As A Minor
Hadwiger's Conjecture for inflations of 3-chromatic graphs
Hadwiger's Conjecture for the Complements of Kneser Graphs
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 17 REFERENCES
Graph minors. IX. Disjoint crossed paths
Contractions to k8
A Polynomial Solution to the Undirected Two Paths Problem
The Factorization of Linear Graphs
2-Linked Graphs
Every planar map is four colorable. Part I: Discharging
Über trennende Eckenmengen in homomorphiekritischen Graphen
  • W. Mader
  • Mathematics, Computer Science
  • 1967
...
1
2
...