1 citations · 2 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
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…