List 3-dynamic coloring of graphs with small maximum average degree

摘要

An r-dynamic k-coloring of a graph G is a proper k-coloring such that for any vertex v, there are at least min{r, deg(G)(v)) distinct colors in N-G(v). The r-dynamic chromatic number chi(d)(r)(G) of a graph G is the least k such that there exists an r-dynamic k-coloring of G. The list r-dynamic chromatic number of a graph G is denoted by ch(r)(d)(G).