On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs
arXiv:1110.1693
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.