Skip to main navigation Skip to search Skip to main content

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

  • Ton Kloks*
  • , Sheung Hung Poon
  • , Chin Ting Ung
  • , Yue Li Wang
  • *Corresponding author for this work

Research output: Journal PublicationConference articlepeer-review

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)157-168
Number of pages12
JournalLecture Notes in Computer Science
Volume7434 LNCS
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event18th Annual International Computing and Combinatorics Conference, COCOON 2012 - Sydney, NSW, Australia
Duration: 20 Aug 201222 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