Year: 2024
Type: article
Abstract: A 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 $\chi_2(G)$. We prove that if $G$ is a planar graph with girth $5$ and maximum degree $\Delta \geq 12$, then $\chi_2(G)\leq \Delta(G)+5$.
Source: DergiPark (Istanbul University)
Author: Aras, Elif
Institution: Düzce Üniversitesi
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4414925545
FWCI:
Cites:
Cited by:
Related to: