5 citations · 18 across the 34 of their papers we have counts for
Showing 2011 · cs.DSShow all
3 papers · 2 filters
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.
cs.DS2011
A linear-time algorithm for the strong chromatic index of Halin graphs
Ton Kloks, Yue-Li Wang
We show that there exists a linear-time algorithm that computes the strong chromatic index of Halin graphs.