Cycle decompositions III: Complete graphs and fixed length cycles
Cycle decompositions III: Complete graphs and fixed length cycles
复制标题
DOI：
10.1002/jcd.1027
复制
发表时间：
2002
影响因子：
0.7
通讯作者：
M. Šajna
中科院分区：
文献类型：
--
作者：
M. Šajna
我们证明了将奇数阶完全图分解为固定偶数长度的循环以及将偶数阶减去 1 因子的完全图分解为固定奇数长度的循环的必要条件也是充分的。 © 2002 John Wiley & Sons, Inc. J Combin Designs 10: 27–78, 2002
We show that the necessary conditions for the decomposition of the complete graph of odd order into cycles of a fixed even length and for the decomposition of the complete graph of even order minus a 1‐factor into cycles of a fixed odd length are also sufficient. © 2002 John Wiley & Sons, Inc. J Combin Designs 10: 27–78, 2002