A strong edge-coloring of a graph G is a proper edge-coloring such that any two edges with distance at most 2 receive different colors. The strong chromatic index of G, denoted by chi(s)'(G), is the least possible number of colors in a strong edge-coloring of G. Erdos and Nesetril conjectured that every graph G with maximum degree Delta(G) has chi(s)'(G