What is known about the hardness of the chromatic index for restricted graph classes?
Here's one very relevant looking result:

Koreas, Diamantis P. (1997), "The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3", Appl. Math. Comput. 83 (1): 13–17.

The title is self-explanatory.