5 citations · 18 across the 34 of their papers we have counts for
9 papers · 1 filter
P_3-Games on Chordal Bipartite Graphs
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu +3
Let G=(V,E) be a connected graph. A set U subseteq V is convex if G[U] is connected and all vertices of V\U have at most one neighbor in U. Let sigma(W) denote the unique smallest…
A note on triangle partitions
Ton Kloks
Koivisto studied the partitioning of sets of bounded cardinality. We improve his time analysis somewhat, for the special case of triangle partitions, and obtain a slight improvemen…
Packing interval graphs with vertex-disjoint triangles
Ton Kloks
We show that there exists a polynomial algorithm to pack interval graphs with vertex-disjoint triangles.
A note on probe cographs
Ton Kloks
Let G be a graph and let N_1, ..., N_k be k independent sets in G. The graph G is a k-probe cograph if G can be embedded into a cograph by adding edges between vertices that are co…
k-Probe DH-graphs
T. Kloks
Let k be a natural number. Let G be a graph and let N_1,...,N_k be k independent sets in G. The graph G is k-probe distance hereditary if G can be embedded into a DH-graph by addin…
The black-and-white coloring problem on permutation graphs
Ton Kloks
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…