4 citations · 4 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2012
On the threshold-width of graphs
M. Chang, L. Hung, T. Kloks +1
The GG-width of a class of graphs GG is defined as follows. A graph G has GG-width k if there are k independent sets N1,...,Nk in G such that G can be embedded into a graph H in GG…
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…