The list 2-distance coloring of a graph with Δ(G) = 5
Yuehua Bu, Xia Lv, Xiaoyan Yan · Discrete Mathematics Algorithms and Applications · 2015
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.