On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs
Data Structures and Algorithms
2011-10-11 v1
Abstract
We show that there exist linear-time algorithms that compute the strong chromatic index and a maximum induced matching of tree-cographs when the decomposition tree is a part of the input. We also show that there exists an efficient algorithm for the strong chromatic index of permutation graphs.
Keywords
Cite
@article{arxiv.1110.1693,
title = {On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs},
author = {Ton Kloks and Chin-Ting Ung and Yue-Li Wang},
journal= {arXiv preprint arXiv:1110.1693},
year = {2011}
}