A new result of list 2-distance coloring of planar graphs with g(G) ≥ 5

Abstract

It was proved in [Y. Bu and C. Shang, List 2-distance coloring of planar graphs without short cycles, Discrete Math. Algorithm. Appl. 8 (2016) 1650013] that for every planar graph with girth [Formula: see text] and maximum degree [Formula: see text] is list 2-distance [Formula: see text]-colorable. In this paper, we proved that: for every planar graph with [Formula: see text] and [Formula: see text] is list 2-distance [Formula: see text]-colorable.