Wegner's conjecture on 2-distance coloring (Q2151384)

The problem of 2-distance \(k\)-coloring for simple graphs was raised in [\textit{G. Wegner}, Graphs with given diameter and a coloring problem. Techn. Rep., University of Dortmund (1977)]. Several research papers have appeared on this topic. Wegner showed that the value of the 2-distance \(k\)-coloring parameter is at most 8 for all those planar graphs whose maximum degree is 3. He also raised a conjecture on the general case which is yet to be settled. The authors of this paper obtain some upper bound for this parameter and improve the result of \textit{J. Zhu} and \textit{Y. Bu} [J. Comb. Optim. 36, No. 1, 55--64 (2018; Zbl 1400.05092)]. But Wegner's conjecture is open for researchers working in this area. For the entire collection see [Zbl 1490.68034].