A Sufficient Condition for a Planar Graph to Be 3-choosable
Yingqian Wang · Journal of Anqing Teachers College · 2011
Assigning each vertex of G=(V,E) a list L={L(v)|v∈V},if G has a proper coloring φ such that φ(v)∈L(v) for every vertex v,then we say that G is L-colorable.A graph G is k-choosable,if it is L-colorable for every list assignment L with |L(v)|≥k for all v∈V.According to the discharging,it is shown that every planar graph without 4-,6-,8-or 10-cycles is 3-choosable.