4 citations · 4 across the 4 of their papers we have counts for
Showing 2012 · math.COShow all
2 papers · 2 filters
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…