加载中…
A vertex coloring of a graph is called a 2-distance coloring if any two vertices at a distance at most from each other receive different colors. Suppose that is a planar graph with girth and maximum degree . We prove that admits a -distance coloring, which improves the result of Dong and Lin (J. Comb. Optim. 32(2), 645-655, 2016). Moreover, we prove that admits a -distance coloring when .

生成讲解博客的中文版本

生成AI智能校验的中文版本