Even cycle decompositions of complete graphs minus a 1‐factor
From MaRDI portal
Publication:4764673
DOI10.1002/JCD.3180020607zbMATH Open0846.05064OpenAlexW2133044737MaRDI QIDQ4764673FDOQ4764673
Authors: Brian Alspach, Susan Marshall 
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
Recommendations
Other designs, configurations (05B30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (13)
- Brian Alspach and his work
- Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor
- The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs.
- Title not available (Why is that?)
- Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
- On decomposing \(K_n -I\) into cycles of a fixed odd length
- Decomposition of complete graphs into cycles and stars
- Pancomponented 2-factorizations of complete graphs
- Resolvably decomposing complete equipartite graphs minus a one-factor into cycles of uniform even length.
- Title not available (Why is that?)
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\)
- Decomposition of the complete graph plus a 1‐factor into cycles of equal length
This page was built for publication: Even cycle decompositions of complete graphs minus a 1‐factor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764673)
