L. Wang

most citedCompleting the spectrum of almost resolvable cycle systems with odd cycle length

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2021

The Hamilton-Waterloo problem on wreath product graph $C_{m} ≀ K_{16}$

L. Wang, H. Cao

The Hamilton-Waterloo problem is a problem of graph factorization. The Hamilton-Waterloo problem HWP $(H; m, n; α, β)$ asks for a $2$ -factorization of $H$ containing $α$ $C_{m}$ -factors a…

math.CO2017★ 1 cited

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 $4 k + 1$ for odd $k \geq 11$ . This completes the proof of the existence of almost resolvable cycle systems with odd…

The Hamilton-Waterloo problem on wreath product graph Cm​≀K16​

Completing the spectrum of almost resolvable cycle systems with odd cycle length

The Hamilton-Waterloo problem on wreath product graph $C_{m} ≀ K_{16}$