Every graph with no $K_7^{\vee }$-minor is $6$-colorable

Abstract

Let $K_7^{\vee }$ denote the graph obtained from the complete graph on seven vertices by deleting two edges with a common end. Motivated by Hadwiger's conjecture, we prove that every graph with no $K_7^{\vee }$-minor is $6$-colorable.