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 mfactors and β C n -factors. In this paper, we almost completely solve the Hamilton-Waterloo problem on wreath product graph C m ≀ K 16 with C 16 -factors and C m -factors for an odd integer m.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.