Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar graphs
Data Structures and Algorithms
2011-10-05 v1
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
Cite
@article{arxiv.1110.0583,
title = {Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar graphs},
author = {Ton Kloks and Sheung-Hung Poon and Chin-Ting Ung and Yue-Li Wang},
journal= {arXiv preprint arXiv:1110.0583},
year = {2011}
}