3 citations · 3 across the 3 of their papers we have counts for
4 papers
On local antimagic vertex coloring for complete full -ary trees
Martin Bača, Andrea Semaničová-Feňovčíková, Ruei-Ting Lai +1
Let be a finite simple undirected graph without components. A bijection is called a local antimagic labeling if for any…
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…
P_3-Games
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu +2
Without further ado, we present the P_3-game. The P_3-game is decidable for elementary classes of graphs such as paths and cycles. From an algorithmic point of view, the connected…
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…