A Result on the 2-Distance Coloring of Planar Graphs with Girth Five
Küçük Resim Yok
Tarih
2025
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Prof. Dr. Mehmet Zeki SARIKAYA
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
A vertex coloring of a graph G is said to be a 2-distance coloring if any two vertices at distance at most 2 from each other receive different colors, and the least number of colors for which G admits a 2-distance coloring is known as the 2-distance chromatic number of G, and denoted by χ<inf>2</inf>(G). We prove that if G is a planar graph with girth 5 and maximum degree ∆ ≥ 12, then χ<inf>2</inf>(G) ≤ ∆(G) + 5. © 2025 Elsevier B.V., All rights reserved.
Açıklama
Anahtar Kelimeler
2-distance Coloring, Coloring, Girth, Planar Graph
Kaynak
Konuralp Journal of Mathematics
WoS Q Değeri
Scopus Q Değeri
N/A
Cilt
13
Sayı
1
