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

doi:10.1007/978-3-642-32241-9_14

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

Research output: Journal Publication › Conference article › peer-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 language	English
Pages (from-to)	157-168
Number of pages	12
Journal	Lecture Notes in Computer Science
Volume	7434 LNCS
DOIs	https://doi.org/10.1007/978-3-642-32241-9_14
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

Keywords

Distance-hereditary graphs
Halin graphs
Outerplanar graphs
Strong chromatic index

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-32241-9_14

Cite this

@article{3b07125d41cb4a6aacff53742a9c7602,

title = "Algorithms for the strong chromatic index of halin graphs, distance-hereditary graphs and maximal outerplanar 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.",

keywords = "Distance-hereditary graphs, Halin graphs, Outerplanar graphs, Strong chromatic index",

author = "Ton Kloks and Poon, \{Sheung Hung\} and Ung, \{Chin Ting\} and Wang, \{Yue Li\}",

year = "2012",

doi = "10.1007/978-3-642-32241-9\_14",

language = "English",

volume = "7434 LNCS",

pages = "157--168",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

note = "18th Annual International Computing and Combinatorics Conference, COCOON 2012 ; Conference date: 20-08-2012 Through 22-08-2012",

}

TY - JOUR

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

AU - Kloks, Ton

AU - Poon, Sheung Hung

AU - Ung, Chin Ting

AU - Wang, Yue Li

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - Distance-hereditary graphs

KW - Halin graphs

KW - Outerplanar graphs

KW - Strong chromatic index

UR - https://www.scopus.com/pages/publications/84865635386

U2 - 10.1007/978-3-642-32241-9_14

DO - 10.1007/978-3-642-32241-9_14

M3 - Conference article

AN - SCOPUS:84865635386

SN - 0302-9743

VL - 7434 LNCS

SP - 157

EP - 168

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - 18th Annual International Computing and Combinatorics Conference, COCOON 2012

Y2 - 20 August 2012 through 22 August 2012

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this