Sciweavers

DM
2011
249views Education» more  DM 2011»
13 years 6 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...