Aras, Elif2025-10-112025-10-1120252147-625Xhttps://hdl.handle.net/20.500.12684/21431A 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.eninfo:eu-repo/semantics/closedAccess2-distance ColoringColoringGirthPlanar GraphArticle13160662-s2.0-105005397548N/A