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.
| Original language | English |
|---|---|
| Pages (from-to) | 157-168 |
| Number of pages | 12 |
| Journal | Lecture Notes in Computer Science |
| Volume | 7434 LNCS |
| DOIs | |
| Publication status | Published - 2012 |
| Externally published | Yes |
| Event | 18th Annual International Computing and Combinatorics Conference, COCOON 2012 - Sydney, NSW, Australia Duration: 20 Aug 2012 → 22 Aug 2012 |
Free Keywords
- Distance-hereditary graphs
- Halin graphs
- Outerplanar graphs
- Strong chromatic index
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science
Fingerprint
Dive into the research topics of 'Algorithms for the strong chromatic index of halin graphs, distance-hereditary graphs and maximal outerplanar graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver