Decomposing Complete Graphs Into Cycles of Length 2P

DOI10.1016/S0167-5060(08)70053-0MaRDI QIDQ3901547zbMATH OpenFDO

Authors Brian Alspach, Badri N. Varma

Publication date 1980

Published in Combinatorics 79 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-5060(08)70053-0

zbMATH Keywords

decompositionsG-designs

Mathematics Subject Classification ID

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

Cited in

(7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3901547)