Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar graphs

TL;DR

This paper presents linear-time algorithms for computing the strong chromatic index in specific graph classes, including Halin graphs, maximal outerplanar graphs, and distance-hereditary graphs.

Contribution

It introduces efficient algorithms that significantly improve the computation of the strong chromatic index for these graph classes.

Findings

Linear-time algorithms for Halin graphs

Linear-time algorithms for maximal outerplanar graphs

Linear-time algorithms for distance-hereditary graphs

Abstract

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.