An improved bound on 2-distance coloring plane graphs with girth 5

作者：Dong, Wei^*; Lin, Wensong

来源：Journal of Combinatorial Optimization, 2016, 32(2): 645-655.

DOI：10.1007/s10878-015-9888-4

• Girth
• Plane graph
• 2-Distance coloring

A vertex coloring is called -distance if any two vertices at distance at most from each other get different colors. The minimum number of colors in 2-distance colorings of is its 2-distance chromatic number, denoted by . Let be a plane graph with girth at least . In this paper, we prove that for arbitrary , which partially improves some known results.

• 出版日期2016-8
• 单位南京晓庄学院; 东南大学