A note on 3-list-coloring of planar graphs
Yingqian Wang · Journal of Zhejiang Normal University · 2009
For any given planar graph G,it was NP-hard to determine whether it could be 3-list-colorable.Using the Discharging method,it was given a sufficient condition for planar graphs to be 3-list-colorable.It was showed that every planar graph would be 3-list-colorable if it contained neither triangles and 5——cycles at distance less than 3 nor intersecting i-cycles and j-cycles where 4≤i≤j≤6.This improved the known results.