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

C. L. Barrett, G. Istrate, V. S. Kumar, M. V. Marathe, S. Thite et al., Strong Edge Coloring for Channel Assignment in Wireless Radio Networks, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06), pp.106-110, 2006.
DOI : 10.1109/PERCOMW.2006.129

F. R. Chung, A. Gyárfas, Z. Tuza, and W. T. Trotter, The maximum number of edges in 2K 2 -free graphs of bounded degree, Discrete Mathematics, vol.91, issue.2, pp.129-135, 1990.

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?s, Problems and results in combinatorial analysis and graph theory, Discrete Mathematics, vol.38, pp.81-92, 1988.

R. J. Faudree, A. Gyárfas, R. H. Schelp, and Z. Tuza, The strong chromatic index of graphs, pp.205-211, 1990.

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

J. L. Fouquet and J. L. Jolivet, Strong edge-coloring of cubic planar graphs, Progress in Graph Theory, pp.247-264, 1984.

H. Hocquard and P. Valicov, Strong edge colouring of subcubic graphs, Discrete Applied Mathematics, vol.159, issue.15, pp.1650-1657, 2011.
DOI : 10.1016/j.dam.2011.06.015
URL : https://hal.archives-ouvertes.fr/hal-00686021

P. Horák, H. Qing, and W. T. Trotter, Induced matchings in cubic graphs, Journal of Graph Theory, vol.10, issue.2, pp.151-160, 1993.
DOI : 10.1002/jgt.3190170204

T. Nandagopal, T. Kim, X. Gao, and V. Barghavan, Achieving MAC layer fairness in wireless packet networks, Proceedings of the 6th annual international conference on Mobile computing and networking , MobiCom '00, pp.87-98, 2000.
DOI : 10.1145/345910.345925

S. Ramanathan and E. L. Lloyd, Scheduling algorithms for multi-hop radio-networks, IEEE/ACM Trans. Networking, vol.2, pp.166-177, 1993.