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

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$.

Authors

Institutions

Publication Details

Journal
DergiPark (Istanbul University)
Published
2024-11-18
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Elif Aras
DergiPark (Istanbul University)
Graph Labeling and Dimension Problems
article

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

Elif Aras
article en

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$.

DergiPark (Istanbul University)
Düzce Üniversitesi (TR)
Openalex Percentile: Top 67%
Graph Labeling and Dimension Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Result on the 2-Distance Coloring of Planar Graphs with Girth Five — Elif Aras · DergiPark (Istanbul University) (2024) | TGRS Research Map | TGRS