2 citations · 7 across the 12 of their papers we have counts for
8 papers · 1 filter
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…
Rainbow domination and related problems on some classes of perfect graphs
Wing-Kai Hon, Ton Kloks, Hsian-Hsuan Liu +1
Let and let be a graph. A function is a rainbow function if, for every vertex with , . The ra…
On Complexities of Minus Domination
Luérbio Faria, Wing-Kai Hon, Ton Kloks +3
A function f: V \rightarrow \{-1,0,1\} is a minus-domination function of a graph G=(V,E) if the values over the vertices in each closed neighborhood sum to a positive number. The w…
Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio
Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu +2
We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. The ultimate categorical inde…
Independent set in categorical products of cographs and splitgraphs
W. Hon, T. Kloks, S. Liu +2
We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. We show that the ultimate cat…
On independence domination
Wing-Kai Hon, Ton Kloks, Hsiang Hsuan Liu +2
Let G be a graph. The independence-domination number is the maximum over all independent sets I in G of the minimal number of vertices needed to dominate I. In this paper we invest…