Sciweavers

101 search results - page 3 / 21
» Grundy number and products of graphs
Sort
View
JAL
2002
99views more  JAL 2002»
13 years 5 months ago
Kayles and Nimbers
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
Hans L. Bodlaender, Dieter Kratsch
ENDM
2007
91views more  ENDM 2007»
13 years 5 months ago
Game chromatic number of Cartesian product graphs
We find exact values for the game chromatic number of the Cartesian product graphs Sm Pn, Sm Cn, P2 Wn, and P2 Km,n. This extends previous results of Bartnicki et al. on the game...
Iztok Peterin
EJC
2008
13 years 5 months ago
The distinguishing number of Cartesian products of complete graphs
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...
Wilfried Imrich, Janja Jerebic, Sandi Klavzar
SIAMDM
2010
133views more  SIAMDM 2010»
13 years 3 months ago
Distinguishing Chromatic Number of Cartesian Products of Graphs
Jeong Ok Choi, Stephen G. Hartke, Hemanshu Kaul