On the existence of elementary Abelian cycle systems
From MaRDI portal
Publication:1043796
DOI10.1007/s00373-008-0826-4zbMath1200.05046MaRDI QIDQ1043796
Anita Pasotti, Anna Miriam Benini
Publication date: 9 December 2009
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11379/19007
05B30: Other designs, configurations
Related Items
Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph, Constructions for cyclic Moebius ladder systems, Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Steiner pentagon systems
- A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\)
- Difference families in \(\text{Z}_{2d+1}\oplus \text{Z}_{2d+1}\) and infinite translation designs in \(\text{Z} \oplus \text{Z}\)
- 2-perfect \(m\)-cycle systems
- Cyclic Hamiltonian cycle systems of the complete graph.
- Existence of Steiner seven-cycle systems
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Existence of cyclic \(k\)-cycle systems of the complete graph
- Some constructions for cyclic perfect cycle systems
- Cycle decompositions III: Complete graphs and fixed length cycles
- Doubly transitive 2-factorizations
- 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