Further results on strong edge-colourings in outerplanar graphs

Valentin Borozan, Leandro Montero, Narayanan Narayanan

An edge-colouring is {\em strong} if every colour class is an induced matching. In this work we give a formulae that determines either the optimal or the optimal plus one strong ch…