On the existence of a cyclic near-resolvable (6n+4)-cycle system of 2 K₁₂n+9
DOI10.1155/2019/5276753zbMATH Open1448.05158OpenAlexW2964707775MaRDI QIDQ2299995FDOQ2299995
Authors: Raja'i Aldiabat, Haslinda Ibrahim, Sharmila Karim 
Publication date: 24 February 2020
Published in: Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2019/5276753
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
Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
- Cycle decompositions of complete multigraphs
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Cyclic Hamiltonian cycle systems of the complete graph.
- On perfect Γ-decompositions of the complete graph
- Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
- 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
- Cyclic odd \(3K\)-cycle systems of the complete graph
- Cyclicm-cycle systems withm ≤ 32 orm = 2q withq a prime power
- Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs
- Almost resolvable 4-cycle systems
- Completing the spectrum of almost resolvable cycle systems with odd cycle length
- Almost resolvable k‐cycle systems with
- The generalized almost resolvable cycle system problem
- Cycle decompositions of complete multigraphs
- Decompositions of complete multigraphs into cycles of varying lengths
- Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the \(k\)-path partition of graphs.
- A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv
- On cyclic decompositions of the complete graph into the 2-regular graphs
- Cyclic even cycle systems of the complete graph
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)
