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.
2018
2018
In this paper, we present a minimal chordal completion G∗ of a graphG satisfying the inequality ω(G∗)−ω(G) ≤ i(G) for the non… 
2016
2016
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… 
2016
2016
We investigate the famous Hadwiger Conjecture, focusing on unconditional convex bodies. We establish some facts about covering… 
2013
2013
La eficacia del nematodo Steinernema carpocapsae en una formulacion de quitosano contra el picudo rojo de las palmeras… 
2012
2012
Reverse Modus Ponens followed by set theory using lines followed by considering the maximum number of colours that can be used… 
2010
2010
The Berge conjecture was proven by Chudnovsky, Robertson, Seymour and Thomas in a paper of 146 pages long (see [1]); in this… 
2010
2010
In this paper, we give a proof for four color theorem(four color conjecture). Our proof does not involve computer assistance and… 
2008
2008
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…