摘要
研究了奇数度循环图，指出：若连通循环图可分解为ｒ个哈密尔顿回（边不相交），则连通循环图可分解为ｒ个哈密尔顿回与条互不相交的边．
The following result is obtained ,If any connected circulant graph can be decomposed into r hamiltonian cycles, then the connected circulant graphcan be decomposed into r hamiltonian cycles and disjoint edges.
出处
《甘肃工业大学学报》
1995年第3期109-112,共4页
Journal of Gansu University of Technology
关键词
循环图
奇数度
分解
哈密顿回
circulant graph
odd degree
hamiltonian cycle
decomposition
