On 2-distance 16-coloring of planar graphs with maximum degree at most five

2023/10/24 by Deniz, Zakir · 3 citations
#05C15 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2310.15899

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 a maximum degree at most 5. We prove that G admits a 2-distance 16 coloring, which improves the result given by Hou et al. (Graphs and Combinatorics 39:20, 2023).

Cited by

• List Coloring of the Square of 4-Irregular Graphs
• 2-Distance Coloring of Planar Graphs with Maximum Degree at Least 6
• The square of every subcubic planar graph without 4-cycles and 5-cycles is 7-choosable

Related

• 2-distance 20-coloring of planar graphs with maximum degree 6
• Improved 2-Distance Coloring of Planar Graphs with Maximum Degree 5
• A 2-distance (2Δ+7)-coloring of planar graphs
• 2-Distance Coloring of Planar Graphs with Maximum Degree at Least 6
• Some results on 2-distance coloring of planar graphs with girth five