In this paper, we almost completely solve the existence of almost resolvable cycle systems with odd cycle length. We also use almost resolvable cycle systems as well as other combinatorial structures to give some new solutions to the Hamilton-Waterloo problem. K E Y W O R D Salmost resolvable cycle system, Hamilton-Waterloo problem, 2-factorization

No abstract

ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a “Full Text” option. The original article is trackable via the “References” option.

No abstract