On Alspach's conjecture

DOI10.1016/0012-365X(89)90355-5zbMath0697.05044WikidataQ56688016 ScholiaQ56688016MaRDI QIDQ911616

Alexander Rosa, Katherine Heinrich, Peter Horák

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

edge partition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (12)

Decomposing the complete graph into cycles of many lengths ⋮ \(2m\)-cycle systems of \(K_{2m+1}\backslash C_m\) ⋮ Decomposition of complete graphs into cycles and stars ⋮ An asymptotic solution to the cycle decomposition problem for complete graphs ⋮ Packing cycles in complete graphs ⋮ Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles ⋮ Decompositions into 2-regular subgraphs and equitable partial cycle decompositions ⋮ Cycle decompositions of complete multigraphs ⋮ On Complete (s,t)-Cycle Systems of Complete Graphs ⋮ Decomposing complete tripartite graphs into cycles of lengths 3 and 4 ⋮ Decomposition of \(K_{m,n}\) into short cycles ⋮ \((m,n)\)-cycle systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of repeated blocks in twofold triple systems
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Balanced incomplete block designs and related designs
• Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture

This page was built for publication: On Alspach's conjecture