On 2-Distance ($Δ+4$)-coloring of planar graphs with girth at least five
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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.