Decomposing Complete Graphs Into Cycles of Length 2P

DOI10.1016/S0167-5060(08)70053-0zbMath0454.05041MaRDI QIDQ3901547

Brian Alspach, Badri N. Varma

Publication date: 1980

Published in: Combinatorics 79 (Search for Journal in Brave)

zbMATH Keywords

decompositionsG-designs

Mathematics Subject Classification ID

Paths and cycles (05C38) Other designs, configurations (05B30)

Related Items (7)

Maximum packings with odd cycles ⋮ Decompositions of circulant-balanced complete multipartite graphs based on a novel labelling approach ⋮ Decomposition of circulant digraphs with two jumps into cycles of equal lengths ⋮ Pack graphs with subgraphs of size three ⋮ On decomposition of the Cartesian product of directed cycles into cycles of equal lengths ⋮ Cycle decompositions III: Complete graphs and fixed length cycles ⋮ Brian Alspach and his work

This page was built for publication: Decomposing Complete Graphs Into Cycles of Length 2P