List coloring triangle‐free planar graphs.

This paper proves the following result. Assume G is a triangle‐free planar graph, X is an independent set of G. If L is a list assignment of G such that |L(v)|=4 for each vertex v∈V(G)−X and |L(v)|=3 for each vertex v∈X, then G is L‐colorable. [ABSTRACT FROM AUTHOR]