List 2-distance Coloring of Planar Graphs with Girth Five  

作　　者：Yin-dong JIN Lian-ying MIAO 

机构地区：[1]School of Mathematics,China University of Mining and Technology,Xuzhou 221116,China

出　　处：《Acta Mathematicae Applicatae Sinica》2022年第3期540-548,共9页应用数学学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(Nos.11771443,12071265)。

摘　　要：A 2-distance coloring of a graph is a coloring of the vertices such that two vertices at distance at most two receive distinct colors.A list assignment of a graph G is a mapping L which assigns to each vertex v a set L(v)of positive integers.The list 2-distance chromatic number of G denoted byχ_(2)^(l)(G)is the least integer k for which G is list 2-distance k-colorable.In this paper,we prove that every planar graph with g(G)≥5 and△(G)≥40 is list 2-distance(△(G)+4)-colorable.

关 键 词：2-distance coloring list 2-distance coloring GIRTH maximum degree 

分 类 号：O157.5[理学—数学]