3 papers
cs.DS2011
On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs
Ton Kloks, Chin-Ting Ung, Yue-Li Wang
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…
cs.DS2011
Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar graphs
Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung +1
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.
math.CO2011
On the strong chromatic index and induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
Ton Kloks, Chin-Ting Ung, Yue-Li Wang
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…