Even cycle decompositions of complete graphs minus a 1‐factor

DOI10.1002/JCD.3180020607zbMATHOpenAlexMaRDI QIDQ4764673FDO

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

zbMATH Keywords

decompositiongraph decompositioncycle decompositionsnearly complete graphone-factor

Mathematics Subject Classification ID

Other designs, configurations (05B30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Cycle decompositions of \(K_n\) and \(K_n-I\)
• scientific article; zbMATH DE number 5200598
• Cycle systems in the complete bipartite graph minus a one-factor
• On decomposing \(K_n -I\) into cycles of a fixed odd length
• Decomposition of the complete graph plus a 1‐factor into cycles of equal length

Cited in

(13)

• scientific article; zbMATH DE number 5200598 (Why is no real title available?)
• The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs.
• On decomposing \(K_n -I\) into cycles of a fixed odd length
• Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\)
• Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
• Decomposition of complete graphs into cycles and stars
• scientific article; zbMATH DE number 536589 (Why is no real title available?)
• Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor
• Resolvably decomposing complete equipartite graphs minus a one-factor into cycles of uniform even length.
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Decomposition of the complete graph plus a 1‐factor into cycles of equal length
• Pancomponented 2-factorizations of complete graphs
• Brian Alspach and his work

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)