GENERALISATIONS OF THE DOYEN–WILSON THEOREM

DOI10.1017/S0004972717001010zbMath1377.05152MaRDI QIDQ4601185

Rosalind A. Hoyte

Publication date: 12 January 2018

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

subsystemgraph decompositioncycle systemDoyen-Wilson theoremcomplete graph with a holecycle switching

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Decompositions of complete multigraphs into cycles of varying lengths
• Decomposition of \(K_{m,n}\) into short cycles
• The Doyen-Wilson theorem extended to 5-cycles
• Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\)
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Decomposing various graphs into short even-length cycles
• Embeddings of Steiner triple systems
• Cycle decompositions III: Complete graphs and fixed length cycles
• Cycle decompositions V: Complete graphs into cycles of arbitrary lengths