DM
2011
13 years 7 months ago
2011
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 ...
DM
2008
14 years 24 days ago
2008
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...