摘要
本文通过讨论n阶圈C_n的m次幂(n>2m)给出连通无爪图的2m次幂存在m个边不交Hamilton圈的一个充分条件。
In this paper,the sufficient conditions are given out that C_n^m can be factorized into Hamilton cycles and G^(2m) has m edge-disjoint Hamilton cycles. Where G is a simple connected K_(1,3)-free graph and C_n is a cycle of order n.
出处
《兰州铁道学院学报》
1993年第4期83-86,共4页
Journal of Lanzhou Railway University
关键词
无爪图
哈密顿圈
幂
K_(1,3)-free graph, Hamilton cycle,power