File:Hadwiger conjecture.svg
| Description | A graph G that requires four colors in any coloring, and four connected subsets of vertices that, when contracted, form a K4 minor of G, illustrating the case k = 4 of Hadwiger's conjecture | ||
| Date | |||
| Source | Own work | ||
| Author | David Eppstein | ||
| Permission (Reusing this file) |
|
