Affiliation:
1. School of Sciences and Arts, Suqian University, Suqian 223800, China
Abstract
The Hamilton–Waterloo problem is a problem of graph factorization. The Hamilton–Waterloo problem HWP(H;m,n;α,β) asks for a two-factorization of a graph H containing α Cm-factors and β Cn-factors. Let Kv* denote the complete graph Kv if v is odd and Kv minus a one-factor if v is even. In this paper, we completely solve the Hamilton–Waterloo problem HWP(Kv*;m,16;α,β) for odd m≥9 and α≥15.
Funder
National Natural Science Foundation of China
Qing Lan Project
Reference38 articles.
1. Colbourn, C.J., and Dinitz, J.H. (2007). The CRC Handbook of Combinatorial Designs, CRC Press. [2nd ed.].
2. West, D. (2001). Introduction to Graph Theory, Prentice Hall. [2nd ed.].
3. Solution of Kirkman’s schoolgirl problem;Wilson;Proc. Symp. Pure Math. Am. Math. Soc.,1971
4. Lu, J.X. (1990). Collected Works on Combinatorial Designs, Inner Mongolia People’s Press.
5. The Oberwolfach problem and factors of uniform odd length cycles;Alspach;J. Comb. Theory Ser. A,1989