Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,475,711 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
30 relations
Albertson conjecture
Apex graph
Clique (graph theory)
Clique-sum
Expand
Broader (1)
Graph coloring
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Colouring Planar Graphs With Three Colours and No Large Monochromatic Components
Louis Esperet
,
G. Joret
Combinatorics, probability & computing
2013
Corpus ID: 1862209
We prove the existence of a function $f :\mathbb{N} \to \mathbb{N}$ such that the vertices of every planar graph with maximum…
Expand
2012
2012
An Original Proof Of The Hadwiger conjecture
I. Nemron
2012
Corpus ID: 120628293
2011
2011
Disproof of the List Hadwiger Conjecture
J. Barát
,
G. Joret
,
D. Wood
Electronic Journal of Combinatorics
2011
Corpus ID: 13822279
The List Hadwiger Conjecture asserts that every $K_t$-minor-free graph is $t$-choosable. We disprove this conjecture by…
Expand
2010
2010
An Original Speech Around the Difficult Part of the Berge Conjecture (Solved by Chudnovsky, Robertson, Seymour and Thomas)
I. Nemron
Communications in Mathematics and Applications
2010
Corpus ID: 56420153
The Berge conjecture was proven by Chudnovsky, Robertson, Seymour and Thomas in a paper of 146 pages long (see [1]); in this…
Expand
2009
2009
Cliques, minors and apex graphs
Jianbing Niu
,
Cun-Quan Zhang
Discrete Mathematics
2009
Corpus ID: 34617645
Highly Cited
2008
Highly Cited
2008
Grad and classes with bounded expansion III. Restricted graph homomorphism dualities
J. Nesetril
,
P. D. Mendez
European journal of combinatorics (Print)
2008
Corpus ID: 16823526
2008
2008
Contractibility and the Hadwiger Conjecture
D. Wood
European journal of combinatorics (Print)
2008
Corpus ID: 6324123
Review
2005
Review
2005
Cuts and bounds
J. Nesetril
,
P. D. Mendez
Discrete Mathematics
2005
Corpus ID: 2498222
2001
2001
Connected Matchings
K. Cameron
Combinatorial Optimization
2001
Corpus ID: 33386106
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…
Expand
1981
1981
Kempe classes and the Hadwiger Conjecture
M. Vergnas
,
H. Meyniel
Journal of combinatorial theory. Series B (Print)
1981
Corpus ID: 122861003
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE