Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs

DOI10.1007/978-3-642-32241-9_14zbMATH Open1364.05073arXiv1110.0583OpenAlexW1551874350WikidataQ62041786 ScholiaQ62041786MaRDI QIDQ2914320FDOQ2914320

Authors: Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung, Yue-Li Wang

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1110.0583

zbMATH Keywords

strong chromatic index distance-hereditary graphs Halin graphs outerplanar graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914320)