Sciweavers

DM
2011
249views Education» more  DM 2011»
14 years 4 months ago
Acyclic vertex coloring of graphs of maximum degree 5
An acyclic vertex coloring of a graph is a proper vertex coloring such that there are no bichromatic cycles.  The acyclic chromatic number of G, denoted ...
Kishore Yadav, Satish Varagani, Kishore Kothapalli...
97
Voted
GC
2008
Springer
14 years 9 months ago
On the Acyclic Chromatic Number of Hamming Graphs
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...
Robert E. Jamison, Gretchen L. Matthews