2-Distance list $$(\Delta +2)$$ ( Δ + 2 ) -coloring of planar graphs with girth at least 10

Journal of Combinatorial Optimization - Given a graph G and a list assignment L(v) for each vertex of v of G, a proper L-list-coloring of G is a function that maps every vertex to a color in L(v)...