Deniz, Zakir2025-10-112025-10-1120250166-218X1872-6771https://doi.org/10.1016/j.dam.2024.09.035https://hdl.handle.net/20.500.12684/21998A 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 chi(2)(G) of G. When G is a planar graph with girth at least 6 and maximum degree triangle >= 6, we prove that chi(2)(G) <= triangle+4. This improves the best known bound for 2-distance coloring of planar graphs with girth six. (c) 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.en10.1016/j.dam.2024.09.035info:eu-repo/semantics/closedAccessColoring2-distance coloringGirthPlanar graphArticle3611211352-s2.0-85206070438WOS:001339125600001Q1Q2