Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
DOI10.1002/JCD.10061zbMATH Open1044.05045OpenAlexW2011607398MaRDI QIDQ4452473FDOQ4452473
Authors: Marco Buratti 
Publication date: 12 February 2004
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.10061
Recommendations
- A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv
- scientific article; zbMATH DE number 2192108
- Existence of 1-rotational \(k\)-cycle systems of the complete graph
- \(3\cdot 2^{r+1}\)-cycle systems of \(K_n-C_n\)
- Cyclic odd \(3K\)-cycle systems of the complete graph
- Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
- scientific article; zbMATH DE number 637298
- A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\)
- scientific article
- scientific article; zbMATH DE number 4185615
Other designs, configurations (05B30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (37)
- On the existence of 5-Sun systems
- Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
- On the existence of \(k\)-sun systems
- \(p^2\)-cycle decompositions of the tensor product of complete graphs
- Spectrum of 3-uniform 6- and 9-cycle systems over \(K_v^{( 3 )} - I\)
- Cycle decompositions of complete multigraphs
- Mutually orthogonal cycle systems
- Title not available (Why is that?)
- Primitive cycle decompositions of Kn and Kn−I
- Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs
- On equitably 2-colourable odd cycle decompositions
- Dihedral Hamiltonian cycle systems of the cocktail party graph
- Heffter spaces
- Maximum packings of inside perfect \(8\)-cycle systems
- On the existence of elementary Abelian cycle systems
- \(2p\)-cycle decompositions of some regular graphs and digraphs
- Existence of 1-rotational \(k\)-cycle systems of the complete graph
- Cyclic cycle systems of the complete multipartite graph
- Decompositions of some classes of regular graphs and digraphs into cycles of length \(4p\)
- Orthogonal cycle systems with cycle length less than 10
- A reduction of the spectrum problem for odd sun systems and the prime case
- Cyclic Hamiltonian cycle systems of the complete graph.
- A note on \(\alpha \)-labelings of \(2k\)-sun graphs
- On tight 6-cycle decompositions of complete 3-uniform hypergraphs
- Maximum cyclic 4-cycle packings of the complete multipartite graph
- Equitably 2-colourable even cycle systems
- Resolvable even‐cycle systems with a 1‐rotational automorphism
- A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv
- On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\)
- Even‐cycle systems with prescribed automorphism groups
- Cyclic uniform 2-factorizations of the complete multipartite graph
- On sharply vertex transitive 2-factorizations of the complete graph
- Some constructions for cyclic perfect cycle systems
- Octahedral, dicyclic and special linear solutions of some Hamilton-Waterloo problems
- New \(i\)-perfect cycle decompositions via vertex colorings of graphs
- Odd-cycle systems with prescribed automorphism groups
- Completing the spectrum of almost resolvable cycle systems with odd cycle length
This page was built for publication: Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452473)
