A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv
DOI10.1002/JCD.20217zbMATH Open1227.05111OpenAlexW2086144802MaRDI QIDQ3578152FDOQ3578152
Authors: Shung-Liang Wu, Marco Buratti 
Publication date: 13 July 2010
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20217
Recommendations
- Existence of 1-rotational \(k\)-cycle systems of the complete graph
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
- Some results on 1-rotational Hamiltonian cycle systems
- Resolvable even‐cycle systems with a 1‐rotational automorphism
- Existence of cyclic \(k\)-cycle systems of the complete graph
- A note on the existence of cyclic and 1-rotational kite systems.
- scientific article; zbMATH DE number 4127661
- Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
- 1‐rotationally resolvable 4‐cycle systems of 2Kv
- Existence of rotating-periodic solutions for nonlinear systems via upper and lower solutions
Graph algorithms (graph-theoretic aspects) (05C85) Other designs, configurations (05B30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Cyclic Hamiltonian cycle systems of the complete graph.
- Cycle decompositions of complete graphs
- Existence of cyclic \(k\)-cycle systems of the complete graph
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
- 1-rotational Steiner triple systems over arbitrary groups
- Cyclically decomposing the complete graph into cycles
- On the cyclic decomposition of complete graphs into almost-bipartite graphs
- Existence of 1-rotational \(k\)-cycle systems of the complete graph
- Cycle decompositions with a sharply vertex transitive automorphism group
- Skolem-type difference sets for cycle systems
- On the construction of odd cycle systems
- Steiner triple systems with rotational automorphisms
- The spectrum of 1-rotational Steiner triple systems over a dicyclic group
- On decomposing \(K_n -I\) into cycles of a fixed odd length
- On the cyclic decompositions of the complete graph into polygons with odd number of edges
- Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
Cited In (11)
- Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs
- On the existence of elementary Abelian cycle systems
- Existence of 1-rotational \(k\)-cycle systems of the complete graph
- A reduction of the spectrum problem for odd sun systems and the prime case
- A generalization of the problem of Mariusz Meszka
- Resolvable even‐cycle systems with a 1‐rotational automorphism
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
- 1‐rotationally resolvable 4‐cycle systems of 2Kv
- On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\)
- Completing the spectrum of almost resolvable cycle systems with odd cycle length
- Cyclic even cycle systems of the complete graph
This page was built for publication: A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578152)
