4 citations · 4 across the 4 of their papers we have counts for
3 papers · 1 filter
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…
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…