# Hadwiger's conjecture forK6-free graphs

```@article{Robertson1993HadwigersCF,
title={Hadwiger's conjecture forK6-free graphs},
author={Neil Robertson and Paul D. Seymour and Robin Thomas},
journal={Combinatorica},
year={1993},
volume={13},
pages={279-361}
}```
• Published 1 September 1993
• Mathematics
• Combinatorica
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…
275 Citations

### Hadwiger's conjecture is decidable

• Mathematics
STOC '09
• 2009
This paper proves the following two theorems: There is an O(n2) algorithm to decide whether or not a given graph G satisfies Hadwiger's conjecture for the case t, and every minimal counterexample G to Hadwigers conjecture forThe case t either has at most f(t) vertices, or has a vertex set Z of order at most t-5 such that G-Z is planar.

### Hadwiger’s Conjecture and Total Coloring

• Mathematics
• 2021
Hadwiger’s conjecture is one of the most important and long-standing conjectures in graph theory. It was established in  that proving Hadwiger’s conjecture is equivalent to proving the conjecture

### Hadwiger's conjecture and seagull packing

T he four-color theorem [1, 2] is one of the most well-known results in graph theory. Originating from the question of coloring a world map, posed in the middle of the nineteenth century, it has

### Strengthening Hadwiger's conjecture for \$4\$- and \$5\$-chromatic graphs

• Mathematics
• 2022
. Hadwiger’s famous coloring conjecture states that every t -chromatic graph contains a K t -minor. Holroyd [Bull. London Math. Soc. 29, (1997), pp. 139–144] conjectured the following strengthening

### Hadwiger conjecture for 8-coloring graph

• Mathematics
• 2021
Hadwiger Conjecture has been an open problem for over a half century1,6, which says that there is at most a complete graph Kt but no Kt+1 for every t-colorable graph. A few cases of Hadwiger

### Any 7-Chromatic Graphs Has K7 Or K4,4 As A Minor

• Mathematics
Comb.
• 2005
This result verifies the first unsettled case m=6 of the (m,1)-Minor Conjecture which is a weaker form of Hadwiger’s Conjectures and a special case of a more general conjecture of Chartrand et al.

### Improved bound for Hadwiger's conjecture

• Yan Wang
• Mathematics, Computer Science
• 2021
It is shown that every graph with no Kt minor is O(t(log log t)5)-colorable.