Further results on strong edge-colourings in outerplanar graphs
Discrete Mathematics
2013-12-20 v1 Combinatorics
Abstract
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 chromatic index of bipartite outerplanar graphs. Further, we give an improved upper bound for any outerplanar graph which is close to optimal. All our proofs yield efficient algorithms to construct such colourings.
Cite
@article{arxiv.1312.5620,
title = {Further results on strong edge-colourings in outerplanar graphs},
author = {Valentin Borozan and Leandro Montero and Narayanan Narayanan},
journal= {arXiv preprint arXiv:1312.5620},
year = {2013}
}
Comments
8 pages