Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,398,468 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.
2018
2018
C O ] 1 1 O ct 2 01 8 A new minimal chordal completion
Jihoon Choi
,
Soogang Eoh
2018
Corpus ID: 53653052
In this paper, we present a minimal chordal completion G∗ of a graphG satisfying the inequality ω(G∗)−ω(G) ≤ i(G) for the non…
Expand
2016
2016
Minor of K-Chromatic Graphs, Four Color Theorem and Hadwiger Conjecture
A. Saligheh
2016
Corpus ID: 124717485
First we will prove that Kk (the complete graph with k vertices) is a minor of every graph with chromatic number k. Then we will…
Expand
2016
2016
The Hadwiger Conjecture for Unconditional Convex Bodies Daniel Barg
D. Barg
2016
Corpus ID: 37803503
We investigate the famous Hadwiger Conjecture, focusing on unconditional convex bodies. We establish some facts about covering…
Expand
2013
2013
Use of entomopathogenic nematodes in a chitosan formulation against Rhynchophorus ferrugineus in different palm species. Field assays and specific cases in a city and in a botanical garden.
M. M. M. D. Altube
,
A. Altube
,
A. Peña
2013
Corpus ID: 83350836
La eficacia del nematodo Steinernema carpocapsae en una formulacion de quitosano contra el picudo rojo de las palmeras…
Expand
2012
2012
An Original Proof Of The Hadwiger conjecture
I. Nemron
2012
Corpus ID: 120628293
2012
2012
Solution for Hadwiger Conjecture
Wilber Valgusbitkevyt
2012
Corpus ID: 118032230
Reverse Modus Ponens followed by set theory using lines followed by considering the maximum number of colours that can be used…
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
2010
2010
To Prove Four Color Theorem
W. Yue
,
W. Cao
2010
Corpus ID: 119323198
In this paper, we give a proof for four color theorem(four color conjecture). Our proof does not involve computer assistance and…
Expand
2009
2009
Cliques, minors and apex graphs
Jianbing Niu
,
Cun-Quan Zhang
Discrete Mathematics
2009
Corpus ID: 34617645
2008
2008
Hadwiger Conjecture for Inflations of the Petersen Graph
B. Toft
2008
Corpus ID: 18938328
LATEX by Adam Jobson For a family of graphs F closed under subgraphs, and a graph G from F , define a game (G,F) played by…
Expand
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