Abstract The star chromatic index of a graph G is the minimum number of colors needed to properly color the edges of G so that no path or cycle of length four is bi-colored. In this paper, we show that every subcubic graph with maximum average degree less than 11 5 can be star edge colored with at most five colors.