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...
DM
2008
68views more  DM 2008»
13 years 11 months ago
Path bundles on n-cubes
A path bundle is a set of 2a paths in an n-cube, denoted Qn, such that every path has the same length, the paths partition the vertices of Qn, the endpoints of the paths form two s...
Matthew Elder