Some results on 2-distance coloring of planar graphs with girth five
Combinatorics
2025-08-21 v2
Abstract
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 .
Cite
@article{arxiv.2308.00390,
title = {Some results on 2-distance coloring of planar graphs with girth five},
author = {Zakir Deniz},
journal= {arXiv preprint arXiv:2308.00390},
year = {2025}
}
Comments
19 pages, fixed some minor details