The famous Hadwiger Conjecture claims that every graph without K n minor can be colored with fewer than n colors. The following result seems to be the first step in the direction towards the Hadwiger ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results