A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv
From MaRDI portal
Publication:3578152
DOI10.1002/jcd.20217zbMath1227.05111MaRDI QIDQ3578152
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
05C38: Paths and cycles
05B30: Other designs, configurations
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
A generalization of the problem of Mariusz Meszka, Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs, Completing the spectrum of almost resolvable cycle systems with odd cycle length, On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\), Cyclic even cycle systems of the complete graph
Cites Work
- Unnamed Item
- Unnamed Item
- Steiner triple systems with rotational automorphisms
- On decomposing \(K_n -I\) into cycles of a fixed odd length
- Skolem-type difference sets for cycle systems
- Cyclic Hamiltonian cycle systems of the complete graph.
- Cyclically decomposing the complete graph into cycles
- 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
- The spectrum of 1-rotational Steiner triple systems over a dicyclic group
- 1-Rotational Steiner triple systems over arbitrary groups
- On the construction of odd cycle systems
- 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
