Elsevier

Discrete Applied Mathematics

Volume 157, Issue 4, 28 February 2009, Pages 659-662
Discrete Applied Mathematics

List-coloring graphs without K4,k-minors

https://doi.org/10.1016/j.dam.2008.08.015Get rights and content
Under an Elsevier user license
open archive

Abstract

In this note, it is shown that every graph with no K4,k-minor is 4k-list-colorable. We also give an extremal function for the existence for a K4,k-minor. Our proof implies that there is a linear time algorithm for showing that either G has a K4,k-minor or G is 4k-choosable. In fact, if the latter holds, then the algorithm gives rise to a 4k-list-coloring.

Keywords

List-coloring
Hadwiger’s conjecture

Cited by (0)