Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
DOI10.1002/JCD.20002zbMATH Open1045.05025OpenAlexW2120823482MaRDI QIDQ4739595FDOQ4739595
Authors: Andrea Vietri 
Publication date: 6 August 2004
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20002
Recommendations
- \(2m\)-cycle systems of \(K_{2m+1}\backslash C_m\)
- \(3\cdot 2^{r+1}\)-cycle systems of \(K_n-C_n\)
- A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\)
- On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\)
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
- \(k\)-cyclic even cycle systems of the complete graph
- On equationally defining m‐perfect 2m + 1 cycle systems
- Almost resolvable k‐cycle systems with
- scientific article; zbMATH DE number 5914888
- scientific article; zbMATH DE number 2192108
graph decompositioncyclic designRosa sequencecyclic \(k\)-cycle systemHamiltonian cyclic cycle system
Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (30)
- Strong difference families over arbitrary graphs
- Mutually orthogonal cycle systems
- Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
- A non-existence result on cyclic cycle-decompositions of the cocktail party graph
- Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs
- Existence of cyclic \(k\)-cycle systems of the complete graph
- Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph
- A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\)
- A survey of Heffter arrays
- Array cyclic \((5^\ast, 6^{\ast\ast}, 4)\)-cycle design
- Dihedral Hamiltonian cycle systems of the cocktail party graph
- On the existence of elementary Abelian cycle systems
- \(2m\)-cycle systems of \(K_{2m+1}\backslash C_m\)
- Cyclic cycle systems of the complete multipartite graph
- Difference families in \(\text{Z}_{2d+1}\oplus \text{Z}_{2d+1}\) and infinite translation designs in \(\text{Z} \oplus \text{Z}\)
- The existence of cyclic \((v, 4, 1)\)-designs
- Cyclic Hamiltonian cycle systems of the complete graph.
- A note on \(\alpha \)-labelings of \(2k\)-sun graphs
- Maximum cyclic 4-cycle packings of the complete multipartite graph
- Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
- Signed Langford sequences and directed cyclic cycle systems
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
- A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv
- Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
- On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\)
- Some constructions for cyclic perfect cycle systems
- On cyclic decompositions of the complete graph into the 2-regular graphs
- Cyclic loop designs
- Square integer Heffter arrays with empty cells
- Cyclic even cycle systems of the complete graph
This page was built for publication: Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4739595)
