5 citations · 18 across the 34 of their papers we have counts for
35 papers
Complexity of Paired Domination in AT-free and Planar Graphs
Vikash Tripathi, Ton Kloks, Arti Pandey +2
For a graph , a subset of vertex set , is a dominating set of if every vertex not in is adjacent to atleast one vertex of . A dominating set of a gra…
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.
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…
On the Grundy number of Cameron graphs
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu +2
The Grundy number of a graph is the maximal number of colors attained by a first-fit coloring of the graph. The class of Cameron graphs is the Seidel switching class of cographs. I…
Flood-it on AT-Free Graphs
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu +2
Solitaire {\sc Flood-it}, or {\sc Honey-Bee}, is a game played on a colored graph. The player resides in a source vertex. Originally his territory is the maximal connected, monochr…
Convexities in Some Special Graph Classes ---New Results in AT-free Graphs and Beyond
Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu +2
We study convexity properties of graphs. In this paper we present a linear-time algorithm for the geodetic number in tree-cographs. Settling a 10-year-old conjecture, we prove that…