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

Basit Öğe Kaydı
dc.authoridDeniz, Zakir/0000-0002-0701-0397
dc.contributor.authorDeniz, Zakir
dc.date.accessioned2025-10-11T20:48:34Z
dc.date.available2025-10-11T20:48:34Z
dc.date.issued2025
dc.departmentDüzce Üniversitesien_US
dc.description.abstractA 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.en_US
dc.description.sponsorshipTUBITAK (The Scientific and Technological Research Council of Turkey) [122F250]en_US
dc.description.sponsorshipThis research was supported by TUBITAK (The Scientific and Technological Research Council of Turkey) under the project number 122F250. The author extends thanks to Kengo Aoki, and the anonymous referees for their careful reading and numerous suggestions for improving the presentation. Their feedback revealed several errors in the early version of this paper and significantly contributed to its overall improvement.en_US
dc.identifier.doi10.1016/j.disc.2024.114379
dc.identifier.issn0012-365X
dc.identifier.issn1872-681X
dc.identifier.issue4en_US
dc.identifier.scopus2-s2.0-85213234069en_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.urihttps://doi.org/10.1016/j.disc.2024.114379
dc.identifier.urihttps://hdl.handle.net/20.500.12684/21995
dc.identifier.volume348en_US
dc.identifier.wosWOS:001412028600001en_US
dc.identifier.wosqualityQ2en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.institutionauthorDeniz, Zakir
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofDiscrete Mathematicsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.snmzKA_WOS_20250911
dc.subjectColoringen_US
dc.subject2-distance coloringen_US
dc.subjectGirthen_US
dc.subjectPlanar graphen_US
dc.titleOn 2-distance 16-coloring of planar graphs with maximum degree at most fiveen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu