Title of article :
Choosability of K5-minor-free graphs
Author/Authors :
Riste S?krekovski، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1998
Abstract :
Thomassen, 1994 showed that all planar graphs are 5-choosable. In this paper we extend this result, by showing that all K5-minor-free graphs are 5-choosable.
Keywords :
List coloring , Coloring , Graph
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
