4 citations · 4 across the 4 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2013
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…
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…