Decompositions of Complete Multipartite Graphs into Cycles of Even Length

被引：0

作者：

Nicholas J. Cavenagh

Elizabeth J. Billington

机构：

[1] Centre for Combinatorics,

[2] Department of Mathematics,undefined

[3] The University of Queensland,undefined

[4] Brisbane 4072,undefined

[5] Australia. e-mail: ejb@maths.uq.edu.au,undefined

来源：

Graphs and Combinatorics | 2000年 / 16卷

关键词：

Cycle Length; Complete Multipartite Graph;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Necessary and sufficient conditions for the existence of an edge-disjoint decomposition of any complete multipartite graph into even length cycles are investigated. Necessary conditions are listed and sufficiency is shown for the cases when the cycle length is 4, 6 or 8. Further results concerning sufficiency, provided certain “small” decompositions exist, are also given for arbitrary even cycle lengths.

引用

页码：49 / 65

页数：16