English

Some results on 2-distance coloring of planar graphs with girth five

Combinatorics 2025-08-21 v2

Abstract

A vertex coloring of a graph GG is called a 2-distance coloring if any two vertices at a distance at most 22 from each other receive different colors. Suppose that GG is a planar graph with girth 55 and maximum degree Δ\Delta. We prove that GG admits a 22-distance Δ+7\Delta+7 coloring, which improves the result of Dong and Lin (J. Comb. Optim. 32(2), 645-655, 2016). Moreover, we prove that GG admits a 22-distance Δ+6\Delta+6 coloring when Δ10\Delta\geq 10.

Keywords

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