Decomposing complete equipartite graphs into short even cycles
Decomposing complete equipartite graphs into short even cycles
Abstract
In this article we find necessary and sufficient conditions to decompose a complete equipartite graph into cycles of uniform length, in the case that the length is both even and short relative to the number of parts.
Type
Journal Article
Type of thesis
Series
Citation
Smith, B.R. & Cavenagh, N.J. (2010). Decomposing complete equipartite graphs into short even cycles. Journal of Combinatorial Designs, 19(2), 131-143.
Date
2010
Publisher
Wiley