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

2023/11/03 by Deniz, Zakir
#05C15 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2311.02201

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 Δ+4 colors if Δ≥ 22.

Related

• Some results on 2-distance coloring of planar graphs with girth five
• An improved bound for 2-distance coloring of planar graphs with girth six
• A 2-distance (2Δ+7)-coloring of planar graphs
• On 2-distance 16-coloring of planar graphs with maximum degree at most five
• Improved 2-Distance Coloring of Planar Graphs with Maximum Degree 5