2 citations · 5 across the 19 of their papers we have counts for
4 papers · 1 filter
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…
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…
On the strong chromatic index and induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
Ton Kloks, Chin-Ting Ung, Yue-Li Wang
We show that there exist linear-time algorithms that compute the strong chromatic index and a maximum induced matching of tree-cographs when the decomposition tree is a part of the…