8 citations · 15 across the 5 of their papers we have counts for
5 papers · 1 filter
The Hamilton-Waterloo problem on wreath product graph
L. Wang, H. Cao
The Hamilton-Waterloo problem is a problem of graph factorization. The Hamilton-Waterloo problem HWP asks for a -factorization of containing -factors a…
Almost resolvable -cycle systems with
L. Wang, H. Cao
In this paper, we show that if and , then there exists an almost resolvable -cycle system of order for all except possibly for $t=…
Completing the spectrum of almost resolvable cycle systems with odd cycle length
L. Wang, H. Cao
In this paper, we construct almost resolvable cycle systems of order for odd . This completes the proof of the existence of almost resolvable cycle systems with odd…
The Hamilton-Waterloo problem with C8-factors and Cm-factors
L. Wang, H. Cao
In this paper, we almost completely solve the Hamilton-Waterloo problem with C8- factors and Cm-factors where the number of vertices is a multiple of 8m.
Further results on the Hamilton-Waterloo problem
L. Wang, S. Lu, H. Cao
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 com…