Yayınlanmış 1 Ocak 2025 | Sürüm v1
Dergi makalesi Açık

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

Oluşturanlar

  • 1. Duzce Univ, Dept Math, TR-81620 Duzce, Turkiye

Açıklama

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.

Dosyalar

bib-fae16b01-70e7-41d8-a08d-e83dd184b4c6.txt

Dosyalar (136 Bytes)

Ad Boyut Hepisini indir
md5:bb5936dd3e7b37b774a32cbce38c2cbc
136 Bytes Ön İzleme İndir