The list 2-distance coloring of a graph with Δ(G) = 5
From MaRDI portal
Publication:5261051
DOI10.1142/S1793830915500172zbMath1317.05050OpenAlexW2000617651MaRDI QIDQ5261051
Xia Lv, Yuehua Bu, Xiaoyan Yan
Publication date: 1 July 2015
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830915500172
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex degrees (05C07)
Related Items (4)
2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 ⋮ Graph \(r\)-hued colorings -- a survey ⋮ \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) ⋮ 2-distance list \((\varDelta +3)\)-coloring of sparse graphs
Cites Work
- Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\)
- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
- Coloring the square of a \(K_{4}\)-minor free graph
- Coloring squares of planar graphs with girth six
This page was built for publication: The list 2-distance coloring of a graph with Δ(G) = 5
