Enclosings of λ-Fold 5-Cycle Systems: Adding One Vertex
Article first published online: 26 MAR 2013
© 2013 Wiley Periodicals, Inc.
Journal of Combinatorial Designs
Volume 22, Issue 5, pages 196–215, May 2014
How to Cite
Asplund, J., Rodger, C. A. and Keranen, M. S. (2014), Enclosings of λ-Fold 5-Cycle Systems: Adding One Vertex. J. Combin. Designs, 22: 196–215. doi: 10.1002/jcd.21345
- Issue published online: 6 MAR 2014
- Article first published online: 26 MAR 2013
- Manuscript Revised: 25 JAN 2013
- Manuscript Received: 31 OCT 2012
- Skolem sequences
A k-cycle system of a multigraph G is an ordered pair (V, C) where V is the vertex set of G and C is a set of k-cycles, the edges of which partition the edges of G. A k-cycle system of is known as a λ-fold k-cycle system of order V. A k-cycle system of (V, C) is said to be enclosed in a k-cycle system of if and . We settle the difficult enclosing problem for λ-fold 5-cycle systems with u = 1.