标题: (m,n)-cycle systems
作者: Bryant, DE
Khodkar, A
Fu, HL
应用数学系
Department of Applied Mathematics
公开日期: 1-十一月-1998
摘要: We describe a method which, in certain circumstances, may be used to prove that the well-known necessary conditions for partitioning the edge set of the complete graph on an odd number of vertices (or the complete graph on an even number of vertices with a 1-factor removed) into cycles of lengths m(1),m(2),...,m(t) are sufficient in the case \{m(1), m(2), ..., m(t)}\=2. The method is used to settle the case where the cycle lengths are 4 and 5. (C) 1998 Elsevier Science B.V. All rights reserved.
URI: http://dx.doi.org/10.1016/S0378-3758(98)00084-6
http://hdl.handle.net/11536/148190
ISSN: 0378-3758
DOI: 10.1016/S0378-3758(98)00084-6
期刊: JOURNAL OF STATISTICAL PLANNING AND INFERENCE
Volume: 74
起始页: 365
结束页: 370
显示于类别:Articles