On the existence of a cyclic near-resolvable (6n+4)-cycle system of 2 K₁₂n+9
From MaRDI portal
Publication:2299995
Summary: In this article, we prove the existence of a simple cyclic near-resolvable \(((v-1)/2)\)-cycle system of \(2 K_v\) for \(v\equiv 9\pmod{12}\) by the method of constructing its starter. Then, some new properties and results related to this construction are formulated.
Recommendations
- Cyclically near‐resolvable 4‐cycle systems of 2Kv
- Almost resolvable cycle systems --an analogue of Hanani triple systems
- Almost resolvable k‐cycle systems with
- A complete solution to the existence problem for cyclically 2-resolvable 4-cycle systems of the complete multipartite graph
- Existence of cyclic \(k\)-cycle systems of the complete graph
Cites work
- A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv
- Almost resolvable 4-cycle systems
- Almost resolvable k‐cycle systems with
- Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
- Completing the spectrum of almost resolvable cycle systems with odd cycle length
- Cycle decompositions of K_n and K_n-I
- Cycle decompositions of complete multigraphs
- Cycle decompositions of complete multigraphs
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
- Cyclic even cycle systems of the complete graph
- Cyclic Hamiltonian cycle systems of the -fold complete and cocktail party graphs
- Cyclic Hamiltonian cycle systems of the complete graph.
- Cyclic odd 3K-cycle systems of the complete graph
- Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
- Cyclicm-cycle systems withm ≤ 32 orm = 2q withq a prime power
- Decompositions of complete multigraphs into cycles of varying lengths
- Existence of cyclic \(k\)-cycle systems of the complete graph
- scientific article; zbMATH DE number 874508 (Why is no real title available?)
- scientific article; zbMATH DE number 874521 (Why is no real title available?)
- On cyclic decompositions of the complete graph into the 2-regular graphs
- On perfect Γ-decompositions of the complete graph
- On the \(k\)-path partition of graphs.
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
- The generalized almost resolvable cycle system problem
Cited in
(5)
This page was built for publication: On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2299995)
