List coloring triangle‐free planar graphs
Jianzhang Hu, Xuding Zhu · Journal of Graph Theory · 2019
Abstract This paper proves the following result. Assume is a triangle‐free planar graph, is an independent set of . If is a list assignment of such that for each vertex and for each vertex , then is ‐colorable.