N. Alon, B. Sudakov, and A. Zaks, Acyclic edge colorings of graphs, Journal of Graph Theory, vol.37, pp.157-167, 2001.

L. D. Andersen, The strong chromatic index of a cubic graph is at most 10, Discrete Mathematics, vol.108, pp.231-252, 1992.

M. Bonamy, T. Perrett, and L. Postle, Colouring Graphs with Sparse Neighbourhoods: Bounds and Applications

H. Bruhn and F. Joos, A stronger bound for the strong chromatic index, Combinatorics, Probability and Computing, vol.27, pp.21-43, 2018.

X. S. Cai, G. Perarnau, B. Reed, and A. B. Watts, Acyclic edge colourings of graphs with large girth, Random Structures and Algorithms, vol.50, pp.511-533, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01641019

L. Esperet and A. Parreau, Acyclic edge-coloring using entropy compression, European Journal of Combinatorics, vol.34, pp.1019-1027, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00843770

R. J. Faudree, A. Gyárfás, R. H. Schelp, and Z. Tuza, Induced matchings in bipartite graphs, vol.78, pp.83-87, 1989.

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

J. Fiam?ik, The acyclic chromatic class of a graph, Mathematica Slovaca, vol.28, pp.139-145, 1978.

I. Giotis, L. Kirousis, K. I. Psaromiligkos, and D. M. Thilikos, Acyclic edge coloring through the Lovász Local Lemma, Theoretical Computer Science, vol.665, pp.40-50, 2017.

M. C. Golumbic, T. Hirst, and M. Lewenstein, Uniquely restricted matchings, Algorithmica, vol.31, pp.139-154, 2001.

D. Hershkowitz and H. Schneider, Ranks of zero patterns and sign patterns, Linear Multilinear Algebra, vol.34, pp.3-19, 1993.

H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov, On strong edge-colouring of subcubic graphs, Discrete Applied Mathematics, vol.161, pp.2467-2479, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00686021

H. Hocquard, P. Ochem, and P. Valicov, Strong edge-colouring and induced matchings, Information Processing Letters, vol.113, pp.836-843, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00609454

D. K?nig and . Graphen-und-matrizen, Matematikaiés Fizikai Lapok, vol.38, pp.116-119, 1931.

L. Lovász, Three short proofs in graph theory, Journal of Combinatorial Theory, Series B, vol.19, pp.269-271, 1975.

M. Molloy and B. Reed, A bound on the strong chromatic index of a graph, Journal of Combinatorial Theory, Series B, vol.69, pp.103-109, 1997.

V. G. Vizing, On an estimate of the chromatic class of a p-graph, Diskretnyj Analiz, vol.3, pp.25-30, 1964.