Coloration of $K_7^{-}$-minor free graphs

Hadwiger’s conjecture says that every $K_t$-minor free graph is $(t - 1)$-colorable\mathrm{.}Thisproblemhasbeenprovedfor$t \leq 6$butremainsopenfor$t \geq 7$\mathrm{.}$K_7$-minorfreegraphshavebeenprovedtobe$8$-colorable (Albar & Gon\c{c}alves, 2013). We prove here that $K_7^{-}$-minor free graphs are $7$-colorable, where $K_7^{-}$ is the graph obtained from $K_7$ by removing one edge.