1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DM2011★ 1 cited
New parameterized algorithms for edge dominating set
Mingyu Xiao, Ton Kloks, Sheung-Hung Poon
An edge dominating set of a graph G=(V,E) is a subset M of edges in the graph such that each edge in E-M is incident with at least one edge in M. In an instance of the parameterize…
math.CO2011★ 1 cited
Graphs without even holes or diamonds
Ton Kloks
An even hole is an induced chordless cycle of even length at least four. A diamond is an induced subgraph isomorphic to K_4-e. We show that graphs without even holes and without di…
math.CO2011
Some results on triangle partitions
Ton Kloks, Sheung-Hung Poon
We show that there exist efficient algorithms for the triangle packing problem in colored permutation graphs, complete multipartite graphs, distance-hereditary graphs, k-modular pe…