  In this paper, we almost completely solve the existence of an almost
resolvable cycle system 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.
