On 2-distance 16-coloring of planar graphs with maximum degree at most five
Küçük Resim Yok
Tarih
2025
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Elsevier
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
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 Zou et al. (2024) [13]. (c) 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
Açıklama
Anahtar Kelimeler
Coloring, 2-distance coloring, Girth, Planar graph
Kaynak
Discrete Mathematics
WoS Q Değeri
Q2
Scopus Q Değeri
Q2
Cilt
348
Sayı
4
