7 citations · 13 across the 15 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.DS2016
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…
cs.DM2016
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…
cs.GT2016
Budget-Constrained Multi-Battle Contests: A New Perspective and Analysis
Chu-Han Cheng, Po-An Chen, Wing-Kai Hon
In a multi-battle contest, each time a player competes by investing some of her budgets or resources in a component battle to collect a value if winning the battle. There are multi…