摘要
提出了完全图K2n+1分解成n个边不相交的H圈的两种方法.阐明了完全图K2n+1的2因子分解的基本思路.介绍了完全图K17的H圈分解的全过程.
Two methods of decomposing a complete graph K2n+1 into n edge disjoint Hamihonian cycles are proposed. The basic concept of decomposing a complete graph K2n+1 into 2-factors is described. The entire procedure of decomposing a complete graph K17 into Hamiltonian cycles is presented.
出处
《山西师范大学学报(自然科学版)》
2009年第1期8-11,共4页
Journal of Shanxi Normal University(Natural Science Edition)
关键词
完全图
H圈
因子分解
圈着色
边矩阵
complete graph
Hamihonian cycle
factorization
cycle colouring
edge matrix