Decomposing Complete Graphs Into Cycles of Length 2P
From MaRDI portal
Publication:3901547
DOI10.1016/S0167-5060(08)70053-0zbMath0454.05041MaRDI QIDQ3901547
Publication date: 1980
Published in: Combinatorics 79 (Search for Journal in Brave)
Related Items
Decomposition of circulant digraphs with two jumps into cycles of equal lengths, Maximum packings with odd cycles, On decomposition of the Cartesian product of directed cycles into cycles of equal lengths, Brian Alspach and his work, Cycle decompositions III: Complete graphs and fixed length cycles