\((m,n)\)-cycle systems

DOI10.1016/S0378-3758(98)00084-6zbMath0949.05070OpenAlexW2060528122MaRDI QIDQ1299002

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

Publication date: 18 September 2000

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0378-3758(98)00084-6

zbMATH Keywords

partitiondecompositioncycles1-factor

Mathematics Subject Classification ID

Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Decomposition of complete graphs into cycles and stars ⋮ On Complete (s,t)-Cycle Systems of Complete Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• 5-cycle systems with holes
• On Alspach's conjecture
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\)
• 3,5-Cycle decompositions

This page was built for publication: \((m,n)\)-cycle systems