Algorithms for the strong chromatic index of Halin graphs,   distance-hereditary graphs and maximal outerplanar graphs
  We show that there exist linear-time algorithms that compute the strong chromatic index of Halin graphs, of maximal outerplanar graphs and of distance-hereditary graphs. 
Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung and Yue-Li Wang
cs.DS