A Result on the 2-Distance Coloring of Planar Graphs with Girth Five

Basit Öğe Kaydı
dc.contributor.authorAras, Elif
dc.date.accessioned2025-10-11T20:45:34Z
dc.date.available2025-10-11T20:45:34Z
dc.date.issued2025
dc.departmentDüzce Üniversitesien_US
dc.description.abstractA 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.en_US
dc.identifier.endpage66en_US
dc.identifier.issn2147-625X
dc.identifier.issue1en_US
dc.identifier.scopus2-s2.0-105005397548en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.startpage60en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12684/21431
dc.identifier.volume13en_US
dc.indekslendigikaynakScopusen_US
dc.institutionauthorAras, Elif
dc.language.isoenen_US
dc.publisherProf. Dr. Mehmet Zeki SARIKAYAen_US
dc.relation.ispartofKonuralp Journal of Mathematicsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.snmzKA_Scopus_20250911
dc.subject2-distance Coloringen_US
dc.subjectColoringen_US
dc.subjectGirthen_US
dc.subjectPlanar Graphen_US
dc.titleA Result on the 2-Distance Coloring of Planar Graphs with Girth Fiveen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu