Title of article
Locally planar graphs are 5-choosable
Author/Authors
DeVos، نويسنده , , Matt and Kawarabayashi، نويسنده , , Ken-ichi and Mohar، نويسنده , , Bojan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
18
From page
1215
To page
1232
Abstract
It is proved that every graph embedded in a fixed surface with sufficiently large edge-width is 5-choosable.
Keywords
list coloring , Choosability , Edge-width , surface , Locally planar graph
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2008
Journal title
Journal of Combinatorial Theory Series B
Record number
1528761
Link To Document