1. The strong chromatic index of a cubic graph is at most 10;Andersen;Discrete Math.,1992
2. Strong edge coloring sparse graphs;Bensmail;Electron. Note Discrete Math.,2015
3. M. Bonamy, T. Perrett, L. Postle, Colouring Graphs with Sparse Neighbourhoods: Bounds and Applications, manuscript.
4. H. Bruhn, F. Joos, A stronger bound for the strong chromatic index, http://arxiv.org/abs/1504.02583.
5. Strong edge-coloring of graphs with maximum degree 4 using 22 colors;Cranston;Discrete Math.,2006