Sciweavers

30 search results - page 1 / 6
» Distinguishing Chromatic Number of Cartesian Products of Gra...
Sort
View
DM
2010
117views more  DM 2010»
13 years 3 months ago
The distinguishing chromatic number of Cartesian products of two complete graphs
A labeling of a graph G is distinguishing if it is only preserved by the trivial automorphism of G. The distinguishing chromatic number of G is the smallest integer k such that G ...
Janja Jerebic, Sandi Klavzar
SIAMDM
2010
133views more  SIAMDM 2010»
13 years 2 months ago
Distinguishing Chromatic Number of Cartesian Products of Graphs
Jeong Ok Choi, Stephen G. Hartke, Hemanshu Kaul
ENDM
2007
91views more  ENDM 2007»
13 years 3 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
DAM
2007
141views more  DAM 2007»
13 years 3 months ago
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
JGT
2008
103views more  JGT 2008»
13 years 3 months ago
Game coloring the Cartesian product of graphs
: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors....
Xuding Zhu