The Hamilton-Waterloo problem on wreath product graph $C_m \wr K_{16}$

L. Wang; H. Cao

The Hamilton-Waterloo problem on wreath product graph $C_m \wr K_{16}$

Combinatorics 2021-02-25 v1

Authors: L. Wang , H. Cao

Abstract

The Hamilton-Waterloo problem is a problem of graph factorization. The Hamilton-Waterloo problem HWP $(H;m,n;\alpha,\beta)$ asks for a $2$ -factorization of $H$ containing $\alpha$ $C_m$ -factors and $\beta$ $C_n$ -factors. In this paper, we almost completely solve the Hamilton-Waterloo problem on wreath product graph $C_m \wr K_{16}$ with $C_{16}$ -factors and $C_m$ -factors for an odd integer $m$ .

Keywords

hamilton-waterloo problem graph factorization wreath product graph c-factors two-factorization

Cite

@article{arxiv.2102.12063,
  title  = {The Hamilton-Waterloo problem on wreath product graph $C_m \wr K_{16}$},
  author = {L. Wang and H. Cao},
  journal= {arXiv preprint arXiv:2102.12063},
  year   = {2021}
}

Related papers

View all related →