MAKE A MEME View Large Image Hadwiger conjecture.svg A graph G that requires four colors in any coloring and four connected subsets of vertices that when contracted form a K<sub>4</sub> minor of G illustrating the case k   4 of Hadwiger's conjecture Own 2008-05-25 ...
View Original:Hadwiger conjecture.svg (630x630)
Download: Original    Medium    Small Thumb
Courtesy of:commons.wikimedia.org More Like This
Keywords: Hadwiger conjecture.svg A graph G that requires four colors in any coloring and four connected subsets of vertices that when contracted form a K<sub>4</sub> minor of G illustrating the case k   4 of Hadwiger's conjecture Own 2008-05-25 David Eppstein Graph coloring; vertex Files by User David Eppstein from en wikipedia
Terms of Use   Search of the Day