An injective $k$-edge-coloring of a graph $G$ is an assignment colors, i.e. integers in $\{1, \ldots , k\}$, to the edges such that any two each incident with one distinct endpoint third edge, receive colors. The problem determining whether $k$-coloring exists called k-INJECTIVE EDGE-COLORING. We show 3-INJECTIVE EDGE-COLORING NP-complete, even for triangle-free cubic graphs, planar subcubic gr...