Deniz, Zakir2025-10-112025-10-1120250012-365X1872-681Xhttps://doi.org/10.1016/j.disc.2024.114379https://hdl.handle.net/20.500.12684/21995A 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.en10.1016/j.disc.2024.114379info:eu-repo/semantics/closedAccessColoring2-distance coloringGirthPlanar graphArticle34842-s2.0-85213234069WOS:001412028600001Q2Q2