1. The strong chromatic index of a cubic graph is at most 10;Andersen;Discrete Math.,1992
2. C.L. Barrett, G. Istrate, V.S.A. Kumar, M.V. Marathe, S. Thite, S. Thulasidasan, Strong edge coloring for channel assignment in wireless radio networks, in: Proceedings of the 4th Annual IEEE international conference on Pervasive Computing and Communications Workshops, 2006, pp. 106–110.
3. Strong edge-colouring of sparse planar graphs;Bensmail;Discrete Appl. Math.,2014
4. M. Bonamy, T. Perrett, L. Postle, Colouring graphs with sparse neighbourhoods: Bounds and applications, submitted for publication.
5. Precise upper bound for the strong edge chromatic number of sparse planar graphs;Borodin;Discuss. Math. Graph Theory,2013