Title of article
Another proof of the 5-choosability of image-minor-free graphs
Author/Authors
Wenjie He، نويسنده , , Wenjing Miao، نويسنده , , Yufa Shen، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
3
From page
4024
To page
4026
Abstract
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.
Keywords
Choosability , K5K5-minor-free , Wagner graph , List coloring
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
947014
Link To Document