The Hamilton–Waterloo Problem with even cycle lengths

Discrete Mathematics（2019）

引用 1|浏览10

暂无评分

摘要

The Hamilton–Waterloo Problem HWP(v;m,n;α,β) asks for a 2-factorization of the complete graph Kv or Kv−I, the complete graph with the edges of a 1-factor removed, into α Cm-factors and β Cn-factors, where 3≤m更多

查看译文

关键词

2-factorizations,(Resolvable) cycle decompositions,Hamilton–Waterloo problem

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要