List star edge coloring of sparse graphs

We consider also graphs with any maximum degree, we proved that if the maximum average degree of a graph G is less than 73 (resp., 52,83), then chs′(G)≤2Δ(G)−1 (resp., chs′(G)≤2Δ(G), chs′(G)≤2Δ(G)+1).