  The first non-obvious case of Hadwiger's Conjecture states that every graph
$G$ with chromatic number at least 4 has a $K_4$ minor. We give a new proof
that derives the $K_4$ minor from a proper 3-coloring of a subgraph of $G$.
