Showing 2023Show all
2 papers · 1 filter
math.CO2023
On 2-distance 16-coloring of planar graphs with maximum degree at most five
Zakir Deniz
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 grap…
math.CO2023
On 2-Distance ()-coloring of planar graphs with girth at least five
Zakir Deniz
A vertex coloring of a graph is called a 2-distance coloring if any two vertices at distance at most from each other receive different colors. Let be a planar graph wit…