Another proof of the 5-choosability of image-minor-free graphs

Thomassen showed in 1994 that all planar graphs are 5-choosable; Škrekovski showed in 1998 that all image-minor-free graphs also are 5-choosable. In this short paper we prove this result using another method.