Injective edge-coloring of graphs with small maximum degree

Abstract: An injective $k$-edge-coloring of a graph $G$ is a mapping $\phi$: $E(G)\longrightarrow{1,2,...,k}$, such that $\phi(e)\ne\phi(f)$ for any two edges $e$ and $f$ with $N_G(e)\cap N_G(f)\neq \emptyset$, where $N_G(e)$ is the set of edges adjacent to $e$. The smallest integer $k$ such that $G$ has an injective $k$-edge-coloring is called the injective chromatic index of $G$, denoted by $\chi_i'(G)$. In this paper, we prove that $\chi_i'(G)\le 7$ for every graph $G$ with $\Delta(G)\leq 4$ and mad$(G)<\frac{8}{3}$, where $\Delta(G)$ is the maximum degree of $G$.