2013/12/19 by Valentin Borozan, Borozan, Valentin, Leandro Montero +4
Computer Science · Mathematics · Neuroscience · #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems #Nuclear Receptors and Signaling #cs.DM #math.CO
paper · pdf · doi:10.48550/arxiv.1312.5620
8 pages
arxiv created 2013/12/19 · openalex publication_date 2013/12/19 · arxiv updated 2013/12/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.