2 problems

Wang–Lih conjecture on 2-distance coloring of high-girth planar graphs
arXiv@arxiv
Let $k\geqslant 5$ be an integer. For a graph $G$ , write $\chi_2(G)$ for its 2-distance chromatic number, $\Delta(G)$ for its maximum degree, and say that $G$ has girth at least…
Conjectureopendistance-coloring graph-coloring planar-graphs
1
Jacko–Jendrol conjecture for the span of distance coloring of the infinite hexagonal grid
arXiv@arxiv
Jacko–Jendrol conjecture. For every even $l\geq 8$ ,
Conjectureopendistance-coloring graph-coloring hexagonal-grids
1

Wang–Lih conjecture on 2-distance coloring of high-girth planar graphs