Skip to search formSkip to main contentSkip to account menu

Hadwiger conjecture (graph theory)

Known as: Hadwiger conjecture 
In graph theory, the Hadwiger conjecture (or Hadwiger's conjecture) states that, if all proper colorings of an undirected graph G use k or more… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We prove the existence of a function $f :\mathbb{N} \to \mathbb{N}$ such that the vertices of every planar graph with maximum… 
2011
2011
The List Hadwiger Conjecture asserts that every $K_t$-minor-free graph is $t$-choosable. We disprove this conjecture by… 
2010
2010
The Berge conjecture was proven by Chudnovsky, Robertson, Seymour and Thomas in a paper of 146 pages long (see [1]); in this… 
Highly Cited
2008
Highly Cited
2008
2008
2008
  • D. Wood
  • 2008
  • Corpus ID: 6324123
Review
2005
2001
2001
A connected matching M in a graph G is a matching such that every pair of edges of M is joined by an edge of G. Plummer, Stiebitz… 
1981
1981