2-Distance List (Δ+3) -Coloring of Sparse Graphs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Graphs and Combinatorics Year : 2022

2-Distance List (Δ+3) -Coloring of Sparse Graphs

Xuan Hoang La
  • Function : Author
  • PersonId : 1077186
  • IdRef : 264820797

Abstract

A 2-distance list k-coloring of a graph is a proper coloring of the vertices where each vertex has a list of at least k available colors and vertices at distance at most 2 cannot share the same color. We prove the existence of a 2-distance list (Δ+3)-coloring for graphs with maximum average degree less than $\frac{8}{3}$ and maximum degree Δ≥4 as well as graphs with maximum average degree less than $\frac{14}{5}$ and maximum degree Δ≥6.
Fichier principal
Vignette du fichier
2109.11927.pdf (694.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-04041833 , version 1 (17-10-2023)

Identifiers

Cite

Xuan Hoang La. 2-Distance List (Δ+3) -Coloring of Sparse Graphs. Graphs and Combinatorics, 2022, 38 (6), pp.#167. ⟨10.1007/s00373-022-02572-1⟩. ⟨lirmm-04041833⟩
23 View
3 Download

Altmetric

Share

Gmail Facebook X LinkedIn More