L. D. Andersen, The strong chromatic index of a cubic graph is at most 10, Discrete Mathematics, vol.108, issue.1-3, pp.231-252, 1992.
DOI : 10.1016/0012-365X(92)90678-9

J. Bensmail, A. Harutyunyan, H. Hocquard, and P. Valicov, Strong edge-colouring of sparse planar graphs, Discrete Applied Mathematics, vol.179, pp.229-234, 2014.
DOI : 10.1016/j.dam.2014.07.006
URL : https://hal.archives-ouvertes.fr/hal-00932945

J. Bensmail, A. Lagoutte, and P. Valicov, Strong edge-coloring of (3, ?)-bipartite graphs. Preprint available online at http
URL : https://hal.archives-ouvertes.fr/hal-01080279

D. W. Cranston, Strong edge-coloring of graphs with maximum degree 4 using 22 colors, Discrete Mathematics, vol.306, issue.21, pp.2772-2778, 2006.
DOI : 10.1016/j.disc.2006.03.053

P. Erd?-os and J. , Irregularities of partitions, pp.162-163, 1989.

R. J. Faudree, A. Gyárfás, R. H. Schelp, . Zs, and . Tuza, Induced matchings in bipartite graphs, Discrete Mathematics, vol.78, issue.1-2, pp.83-87, 1989.
DOI : 10.1016/0012-365X(89)90163-5

R. J. Faudree, A. Gyárfás, R. H. Schelp, . Zs, and . Tuza, The strong chromatic index of graphs, Ars Combinatoria, vol.29, pp.205-211, 1990.

J. L. Fouquet and J. L. Jolivet, Strong edge-colorings of graphs and applications to multi-k-gons, Ars Combinatoria, vol.16, pp.141-150, 1983.

H. Hocquard, P. Ochem, and P. Valicov, Strong edge-colouring and induced matchings, Information Processing Letters, vol.113, issue.19-21, pp.19-21836, 2013.
DOI : 10.1016/j.ipl.2013.07.026
URL : https://hal.archives-ouvertes.fr/hal-00609454

D. B. West, Strong edge-coloring. Open Problems -Graph Theory and Combinatorics

M. Mahdian, The strong chromatic index of graphs, 2000.