paper

On 2-Distance ()-coloring of planar graphs with girth at least five

arXiv:2311.02201

Abstract

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 .

10 pages. arXiv admin note: text overlap with arXiv:2308.00390