加载中…
A vertex coloring of a graph is called a 2-distance coloring if any two vertices at distance at most from each other receive different colors. Let be a planar graph with girth at least . We prove that admits a -distance coloring with colors if .

生成讲解博客的中文版本

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