The list 2-distance coloring of a graph with Δ(G) = 5-Reference-Cited by-同舟云学术

The list 2-distance coloring of a graph with Δ(G) = 5

Published:2015-05-25 Issue:02 Volume:07 Page:1550017
ISSN:1793-8309
Container-title:Discrete Mathematics, Algorithms and Applications
language:en
Short-container-title:Discrete Math. Algorithm. Appl.

Author:

Bu Yuehua¹,Lv Xia¹,Yan Xiaoyan¹

Affiliation:

1. Department of Mathematics, Zhejiang Normal University, Zhejiang, Jinhua 321004, P. R. China

Abstract

We study the list 2-distance coloring of a graph G, and its maximum average degree, denoted mad (G). For Δ(G) = 5, we proved that [Formula: see text], [Formula: see text], [Formula: see text] and ch 2(G) ≤ 11 if mad (G) < 3 respectively, where ch 2(G) is the list 2-distance chromatic number.

Publisher

World Scientific Pub Co Pte Lt

Subject

Discrete Mathematics and Combinatorics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S1793830915500172

Reference9 articles.

1. Graphs with maximum degreeΔ≥17and maximum average degree less than3are list2-distance(Δ+2)-colorable

2. 2-distance (Δ+2)-coloring of planar graphs with girth six and Δ≥18

3. List 2-distance (Δ+2)-coloring of planar graphs with girth six

4. List 2-distance (Δ + 2)-coloring of planar graphs with girth 6 and Δ ≥ 24

5. Sufficient sparseness conditions forG2to be(Δ+1)-choosable, whenΔ≥5

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Graph r-hued colorings—A survey;Discrete Applied Mathematics;2022-11

2. 2-Distance List $$(\varDelta +3)$$-Coloring of Sparse Graphs;Graphs and Combinatorics;2022-10-08

3. 2-Distance list $$(\Delta +2)$$-coloring of planar graphs with girth at least 10;Journal of Combinatorial Optimization;2022-07-29

4. r-hued (r+1)-coloring of planar graphs with girth at least 8 for r≥9;European Journal of Combinatorics;2021-01

5. 2-Distance $$(\varDelta +1)$$-Coloring of Sparse Graphs Using the Potential Method;Trends in Mathematics;2021