5 citations · 18 across the 34 of their papers we have counts for
Showing 2012 · cs.DMShow all
3 papers · 2 filters
cs.DM2012
Folding graphs
Ton Kloks, Yue-Li Wang
Let G be a graph. Consider two nonadjacent vertices x and y that have a common neighbor. Folding G with respect to x and y is the operation which identifies x and y. After a maxima…
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…
cs.DM2012
The black-and-white coloring problem on circle graphs
Ton Kloks, Sheung-Hung Poon, Yue-Li Wang
Given a graph G and integers b and w. The black-and-white coloring problem asks if there exist disjoint sets of vertices B and W with |B|=b and |W|=w such that no two vertices x in…