5 citations · 18 across the 34 of their papers we have counts for
11 papers · 1 filter
Gray Codes for AT-Free Orders
Jou-Ming Chang, Ton Kloks, Hung-Lung Wang
AT-free graphs are characterized by vertex elimination orders. We show that these AT-free orders of a graph can be generated in constant amortized time.
Set Representations of Linegraphs
Jun-Lin Guo, Tao-Ming Wang, Yue-Li Wang +1
Let be a graph with vertex set and edge set . A family of nonempty sets is a set representation of if there exists a one-to-…
A note on "Folding wheels and fans."
Ton Kloks, Yue-Li Wang
In S.Gervacio, R.Guerrero and H.Rara, Folding wheels and fans, Graphs and Combinatorics 18 (2002) 731-737, the authors obtain formulas for the clique numbers onto which wheels and…
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…
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…
The black-and-white coloring problem on distance hereditary graphs and strongly chordal graphs
Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai +1
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 vertex in B is ad…