4 citations · 4 across the 3 of their papers we have counts for
3 papers
math.CO2012
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…
math.CO2012
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…
cs.DM2012★ 4 cited
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…