The strong chromatic index of Halin graphs

Andersen, 1992, The strong chromatic index of a cubic graph is at most 10, Discrete Math., 108, 231, 10.1016/0012-365X(92)90678-9 Burris, 1997, Vertex-distinguishing proper edge colorings, J. Graph Theory, 26, 73, 10.1002/(SICI)1097-0118(199710)26:2<73::AID-JGT2>3.0.CO;2-C Cameron, 1989, Induced matchings, Discrete Appl. Math., 24, 97, 10.1016/0166-218X(92)90275-F Erdős, 1989, Problem, 162 Faudree, 1990, The strong chromatic index of graphs, Ars Combin., 29B, 205 Golumbic, 2000, New results on induced matchings, Discrete Appl. Math., 101, 157, 10.1016/S0166-218X(99)00194-8 Horák, 1993, Induced matchings in cubic graphs, J. Graph Theory, 17, 151, 10.1002/jgt.3190170204 K.-W. Lih, D.-F. Liu, On the strong chromatic index of cubic Halin graphs (2011) (submitted for publication). M. Mahdian, The strong chromatic index of graphs, M.Sc. Thesis, Department of Computer Science, University of Toronto, 2000. Mahdian, 2002, On the computational complexity of strong edge coloring, Discrete Appl. Math., 118, 239, 10.1016/S0166-218X(01)00237-2 Salavatipour, 2004, A polynomial time algorithm for strong edge coloring of partial k-trees, Discrete Appl. Math., 143, 285, 10.1016/j.dam.2004.03.001 Shiu, 2006, On strong chromatic index of Halin graphs, J. Combin. Math. Combin. Comput., 57, 211 Shiu, 2009, The strong chromatic index of complete cubic Halin graphs, Appl. Math. Lett., 22, 754, 10.1016/j.aml.2008.08.019