Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 1 Aug 2023 in math.CO | (2308.00390v1)

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

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.