Papers
Topics
Authors
Recent
Search
2000 character limit reached

On 2-Distance ($Δ+4$)-coloring of planar graphs with girth at least five

Published 3 Nov 2023 in math.CO | (2311.02201v1)

Abstract: A vertex coloring of a graph $G$ is called a 2-distance coloring if any two vertices at distance at most $2$ from each other receive different colors. Let $G$ be a planar graph with girth at least $5$. We prove that $G$ admits a $2$-distance coloring with $\Delta+4$ colors if $\Delta\geq 22$.

Summary

Paper to Video (Beta)

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.