2-distance list $(\Delta +3)$-coloring of sparse graphs

Hoang La

A 2-distance list k-coloring of a graph is a proper coloring of the vertices where each vertex has a list of at least k available colors and vertices at distance at most 2 cannot s…