Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles

DOI10.1016/J.EJC.2017.07.014zbMath1373.05148OpenAlexW2747893514MaRDI QIDQ1678094

Heather Jordon, Uthoomporn Jongthawonwuth, Saad I. El-Zanati, Charles Vanden Eynden

Publication date: 14 November 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2017.07.014

zbMATH Keywords

Bose construction for Steiner triple systems

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Triple systems (05B07)

Cites Work

• A complete solution to the two-table Oberwolfach problems
• Nesting of cycle systems of odd length
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• On the cyclic decomposition of complete graphs into almost-bipartite graphs
• Graceful valuations of 2-regular graphs with two components
• Cycle decompositions III: Complete graphs and fixed length cycles
• On Decomposing the Complete Graph into the Union of Two Disjoint Cycles
• On bipartite 2-factorizations of kn − I and the Oberwolfach problem
• On the construction of odd cycle systems
• A survey on the existence ofG-Designs
• Strong difference families over arbitrary graphs
• On Cyclic Decompositions of Complete Graphs into Tripartite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles