Some constructions for cyclic perfect cycle systems

DOI10.1016/j.disc.2004.07.021zbMath1073.05017OpenAlexW2011176262MaRDI QIDQ2568471

Francesco Rania, Marco Buratti, Fulvio Zuanni

Publication date: 10 October 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.07.021

zbMATH Keywords

complete graphcomplete \(m\)-partite graph\(i\)-perfect cycle systemKirkman cycle systemSteiner cycle system

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Related Items

Almost 2-perfect 8-cycle systems, On the Oberwolfach problem for single-flip 2-factors via graceful labelings, A cyclic solution for an infinite class of Hamilton-Waterloo problems, Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles, A complete solution to the two-table Oberwolfach problems, Newi-Perfect Cycle Decompositions via Vertex Colorings of Graphs, New 2-designs from strong difference families, 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem, Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs, Constructions for cyclic Moebius ladder systems, Strong difference families over arbitrary graphs, On perfect Γ-decompositions of the complete graph, Some Results on 1‐Rotational Hamiltonian Cycle Systems, On the existence of elementary Abelian cycle systems, On sharply vertex transitive 2-factorizations of the complete graph, The structure of 2-pyramidal 2-factorizations

Cites Work

• From a \((G,k,1)\) to a \((C_ k\oplus G,k,1)\) difference family
• Steiner pentagon systems
• Recursive constructions for cyclic block designs
• Steiner triple systems with rotational automorphisms
• 2-perfect \(m\)-cycle systems
• Existence of \((q,6,1)\) difference families with \(q\) a prime power
• Skolem-type difference sets for cycle systems
• Cyclic Hamiltonian cycle systems of the complete graph.
• Cyclic designs with block size 4 and related optimal optical orthogonal codes
• Existence of Steiner seven-cycle systems
• Cyclically decomposing the complete graph into cycles
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Existence of cyclic \(k\)-cycle systems of the complete graph
• On the cyclic decomposition of complete graphs into almost-bipartite graphs
• Existence of 1-rotational \(k\)-cycle systems of the complete graph
• Cycle decompositions III: Complete graphs and fixed length cycles
• Cyclic resolvability of cyclic Steiner 2-designs
• Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
• Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
• On the cyclic decompositions of the complete graph into polygons with odd number of edges
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item