A linear list-coloring bound in terms of the Hadwiger number

We prove that every finite nonempty graph G satisfies ${\chi }_{\mathrm{list}}(G)\le Ch(G)$ for an absolute integer C, where $h(G)$ is the largest order of a clique minor. This resolves the Linear List Hadwiger conjecture affirmatively.