5 citations · 18 across the 34 of their papers we have counts for
10 papers · 1 filter
The black-and-white coloring problem on distance hereditary graphs and strongly chordal graphs
Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai +1
Given a graph G and integers b and w. The black-and-white coloring problem asks if there exist disjoint sets of vertices B and W with |B|=b and |W|=w such that no vertex in B is ad…
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…
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.
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…
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.
New parameterized algorithms for edge dominating set
Mingyu Xiao, Ton Kloks, Sheung-Hung Poon
An edge dominating set of a graph G=(V,E) is a subset M of edges in the graph such that each edge in E-M is incident with at least one edge in M. In an instance of the parameterize…