List 2-distance coloring of planar graphs

作者：Bu Yuehua^*; Yan Xiaoyan

来源：Journal of Combinatorial Optimization, 2015, 30(4): 1180-1195.

DOI：10.1007/s10878-013-9700-2

• Choice chromatic number
• The maximum degree
• 2-Distance coloring
• Planar graphs

The -distance coloring of a graph is to color the vertices of so that every two vertices at distance at most from each other get different colors. Let be the list 2-distance chromatic number of . In this paper, we show that (1) a planar graph with which contains no -cycles and intersecting 4-cycles has ; (2) a planar graph with and has <= 13.

• 出版日期2015-11
• 单位浙江师范大学