Enclosings of λ‐Fold 5‐Cycle Systems: Adding One Vertex |
| |
Authors: | John Asplund C. A. Rodger Melissa S. Keranen |
| |
Affiliation: | 1. Department of Mathematics and Statistics, Auburn University, Alabama;2. Department of Mathematical Sciences, Michigan Technological University, Houghton, Michigan |
| |
Abstract: | 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. |
| |
Keywords: | enclosing 5‐cycles Skolem sequences |
|
|