Title of article
A sufficient condition for a planar graph to be 3-choosable
Author/Authors
Liang Shen، نويسنده , , Yingqian Wang، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2007
Pages
6
From page
146
To page
151
Keywords
Combinatorial problems , Planar graph , Choosability , cycle
Journal title
Information Processing Letters
Serial Year
2007
Journal title
Information Processing Letters
Record number
130505
Link To Document