On Decomposing the Complete Graph into the Union of Two Disjoint Cycles

DOI10.1007/978-3-319-19315-1_14zbMath1401.05233OpenAlexW1011940379MaRDI QIDQ2946050

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

Publication date: 15 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19315-1_14

zbMATH Keywords

Bose constructiongraph decompositiondisjoint cycles

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 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
• ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS