Bu, Yuehua; Lu, Xia The choosability of the 2-distance coloring of a graph. (Chinese. English summary) Zbl 1349.05101 J. Zhejiang Norm. Univ., Nat. Sci. 38, No. 3, 279-285 (2015). Summary: The problem of the choosability of the 2-distance coloring of a graph \(G\) with \(\Delta(G) = 6\) was studied. Using the discharging method to prove that \(\operatorname{ch}_2 (G) \leq 8\) if the maximum average degree \(\operatorname{mad}(G)<2+\frac{16}{25}\), \(\operatorname{ch}_2 (G) \leq 9\) if \(\operatorname{mad}(G)<2+\frac{4}{5}\) for \(\Delta(G) = 6\). The choosability of the list 2-distance coloring of a graph \(G\) with \(\Delta(G) = 6\) is generalized. MSC: 05C15 Coloring of graphs and hypergraphs Keywords:choosability; 2-distance; discharging method; average degree PDFBibTeX XMLCite \textit{Y. Bu} and \textit{X. Lu}, J. Zhejiang Norm. Univ., Nat. Sci. 38, No. 3, 279--285 (2015; Zbl 1349.05101) Full Text: DOI