Disproof of the list Hadwiger conjecture

zbMath1243.05224arXiv1110.2272MaRDI QIDQ665753

Gwenaël Joret, David R. Wood, János Barát

Publication date: 6 March 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.2272

zbMATH Keywords

choosable \(K_t\)-minor-free graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Related Items (8)

Improved lower bound for the list chromatic number of graphs with no K_t minor ⋮ Bipartite graphs with no \(K_6\) minor ⋮ Local Hadwiger's conjecture ⋮ Refined List Version of Hadwiger’s Conjecture ⋮ Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor ⋮ Maximum 4-degenerate subgraph of a planar graph ⋮ Hadwiger’s Conjecture ⋮ Connectivity and choosability of graphs with no \(K_t\) minor

This page was built for publication: Disproof of the list Hadwiger conjecture