pith. sign in

arxiv: 1110.0583 · v1 · pith:ANXTWXCSnew · submitted 2011-10-04 · 💻 cs.DS

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

classification 💻 cs.DS
keywords graphsalgorithmschromaticdistance-hereditaryhalinindexmaximalouterplanar
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.