5 citations · 18 across the 34 of their papers we have counts for
6 papers · 2 filters
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 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…
Graphs without even holes or diamonds
Ton Kloks
An even hole is an induced chordless cycle of even length at least four. A diamond is an induced subgraph isomorphic to K_4-e. We show that graphs without even holes and without di…
Some results on triangle partitions
Ton Kloks, Sheung-Hung Poon
We show that there exist efficient algorithms for the triangle packing problem in colored permutation graphs, complete multipartite graphs, distance-hereditary graphs, k-modular pe…
Black-and-white threshold graphs
Ling-Ju Hung, Ton Kloks, Fernando Villaamil
Let k be a natural number. We introduce k-threshold graphs. We show that there exists an O(n^3) algorithm for the recognition of k-threshold graphs for each natural number k. k-Thr…
Feedback vertex set on chordal bipartite graphs
Ton Kloks, Ching-Hao Liu, Sheung-Hung Poon
Let G=(A,B,E) be a bipartite graph with color classes A and B. The graph G is chordal bipartite if G has no induced cycle of length more than four. Let G=(V,E) be a graph. A feedba…