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)

Related topics

Related topics

30 relations
Albertson conjectureApex graphClique (graph theory)Clique-sum

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
In this paper, we present a minimal chordal completion G∗ of a graphG satisfying the inequality ω(G∗)−ω(G) ≤ i(G) for the non… 
2018
2018
A new minimal chordal completion
In this paper, we present a minimal chordal completion $G^*$ of a graph $G$ satisfying the inequality $\omega(G^*) - \omega(G… 
2016
2016
The Hadwiger Conjecture for Unconditional Convex Bodies Daniel Barg
We investigate the famous Hadwiger Conjecture, focusing on unconditional convex bodies. We establish some facts about covering… 
2013
2013
On weighted covering numbers with an application to the Levi-Hadwiger conjecture
We define new natural variants of the notions of weighted covering and separation numbers and discuss them in detail. We prove a… 
2012
2012
An Original Proof Of The Hadwiger conjecture
2010
2010
An Original Speech Around the Difficult Part of the Berge Conjecture (Solved by Chudnovsky, Robertson, Seymour and Thomas)
The Berge conjecture was proven by Chudnovsky, Robertson, Seymour and Thomas in a paper of 146 pages long (see [1]); in this… 
2010
2010
To Prove Four Color Theorem
In this paper, we give a proof for four color theorem(four color conjecture). Our proof does not involve computer assistance and… 
2010
2010
A Proof of Four Color Theorem and Its Implication on Hadwiger Conjecture(draft)
2009
2009
Cliques, minors and apex graphs
2008
2008
Hadwiger Conjecture for Inflations of the Petersen Graph
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… 
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)