  A connected $t$-chromatic graph $G$ is \dfn{double-critical} if $G
\backslash\{u, v\}$ is $(t-2)$-colorable for each edge $uv\in E(G)$. A long
standing conjecture of Erd\H{o}s and Lov\'asz that the complete graphs are the
only double-critical $t$-chromatic graphs remains open for all $t\ge6$. Given
the difficulty in settling Erd\H{o}s and Lov\'asz's conjecture and motivated by
the well-known Hadwiger's conjecture, Kawarabayashi, Pedersen and Toft proposed
a weaker conjecture that every double-critical $t$-chromatic graph contains a
$K_t$ minor and verified their conjecture for $t\le7$. Albar and Gon\c{c}alves
recently proved that every double-critical $8$-chromatic graph contains a $K_8$
minor, and their proof is computer-assisted. In this paper we prove that every
double-critical $t$-chromatic graph contains a $K_t$ minor for all $t\le9$. Our
proof for $t\le8$ is shorter and computer-free.
