List 2-distance Coloring of Planar Graphs with Girth Five

作     者：Yin-dong JIN Lian-ying MIAO Yin-dong JIN;Lian-ying MIAO

作者机构：School of MathematicsChina University of Mining and TechnologyXuzhou 221116China 

出 版 物：《Acta Mathematicae Applicatae Sinica》 (应用数学学报（英文版）)

年 卷 期：2022年第38卷第3期

页      面：540-548页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

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

主　　题：2-distance coloring list 2-distance coloring girth maximum degree 

摘      要：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.