Even cycle decompositions of complete graphs minus a 1‐factor
From MaRDI portal
Publication:4764673
DOI10.1002/jcd.3180020607zbMath0846.05064OpenAlexW2133044737MaRDI QIDQ4764673
Susan H. Marshall, Brian Alspach
Publication date: 29 September 1996
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.3180020607
Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs. ⋮ Decomposition of complete graphs into cycles and stars ⋮ Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\) ⋮ Decompositions into 2-regular subgraphs and equitable partial cycle decompositions ⋮ Pancomponented 2-factorizations of complete graphs ⋮ Brian Alspach and his work ⋮ Cycle decompositions of \(K_n\) and \(K_n-I\)
This page was built for publication: Even cycle decompositions of complete graphs minus a 1‐factor