Article ID Journal Published Year Pages File Type
8903036 Discrete Mathematics 2018 13 Pages PDF
Abstract
In this paper, we construct almost resolvable cycle systems of order 4k+1 for odd k≥11. This completes the proof of the existence of almost resolvable cycle systems with odd cycle length. As a by-product, some new solutions to the Hamilton-Waterloo problem are also obtained.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,