(m,n) -cycle systems

Darryn E. Bryant, A. Khodkar, Hung-Lin Fu

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

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 m1,m2,...,mt are sufficient in the case {m1,m2,...,mt}=2. The method is used to settle the case where the cycle lengths are 4 and 5.

Original languageEnglish
Pages (from-to)365-370
Number of pages6
JournalJournal of Statistical Planning and Inference
Volume74
Issue number2
DOIs
StatePublished - 1 Nov 1998

Fingerprint Dive into the research topics of '(m,n) -cycle systems'. Together they form a unique fingerprint.

Cite this