1. The strong chromatic index of a cubic graph is at most 10;Andersen;Topological, algebraical and combinatorial structures, Frolík's memorial volume, Discrete Math.,1992
2. The maximum number of edges in 2K2-free graphs of bounded degree;Chung;Discrete Math.,1990
3. The strong chromatic index of graphs;Faudree;Ars Combin.,1990
4. P. Horák, The strong chromatic index of graphs with maximum degree four, Contemporary Methods in Graph Theory, 1990, pp. 399–403.
5. Introduction to Graph Theory;West,2001