10 search results - page 1 / 2 » Coloring the square of the Cartesian product of two cycles |
DM
2010
13 years 5 months ago
2010
ARSCOM
2006
13 years 5 months ago
2006
Let Za
DM
2010
13 years 5 months ago
2010
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 ...
GC
2008
Springer
13 years 5 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
JGT
2008
13 years 5 months ago
2008
: 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....