4 citations · 4 across the 4 of their papers we have counts for
5 papers
Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio
Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu +2
We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. The ultimate categorical inde…
Independent sets in edge-clique graphs
Maw-Shang Chang, Ton Kloks, Ching-Hao Liu
We show that the edge-clique graphs of cocktail party graphs have unbounded rankwidth. This, and other observations lead us to conjecture that the edge-clique cover problem is NP-c…
Independent sets in edge-clique graphs II
Ching-Hao Liu, Ton Kloks, Sheung-Hung Poon
We show that edge-clique graphs of cocktail party graphs have unbounded rankwidth. This, and other observations lead us to conjecture that the edge-clique cover problem is NP-compl…
Edge-clique graphs of cocktail parties have unbounded rankwidth
Maw-Shang Chang, Ton Kloks, Ching-Hao Liu
In an attempt to find a polynomial-time algorithm for the edge-clique cover problem on cographs we tried to prove that the edge-clique graphs of cographs have bounded rankwidth. Ho…
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…