Completing the spectrum of almost resolvable cycle systems with odd cycle length
From MaRDI portal
Publication:1709552
DOI10.1016/J.DISC.2017.10.013zbMath1383.05175arXiv1706.05958OpenAlexW2962895854MaRDI QIDQ1709552
Publication date: 5 April 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.05958
Related Items (2)
On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\) ⋮ Factorizations of complete graphs into cycles and 1-factors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A cyclic solution for an infinite class of Hamilton-Waterloo problems
- Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
- The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors
- On the existence of cycle frames and almost resolvable cycle systems
- The generalized almost resolvable cycle system problem
- Hanani triple systems
- More results on cycle frames and almost resolvable cycle systems
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
- The solution of the bipartite analogue of the Oberwolfach problem
- The Oberwolfach problem and factors of uniform odd length cycles
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- The equipartite Oberwolfach problem with uniform tables
- A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors
- Cycle decompositions III: Complete graphs and fixed length cycles
- On the Hamilton-Waterloo Problem with triangle factors and $C_{3x}$-factors
- Octahedral, dicyclic and special linear solutions of some Hamilton-Waterloo problems
- Almost resolvable cycle systems-an analogue of Hanani triple systems
- A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv
- Some observations on the oberwolfach problem
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
- The Hamilton-Waterloo Problem for C3-Factors and Cn-Factors
- A Generalization of the Hamilton–Waterloo Problem on Complete Equipartite Graphs
- Two new direct product‐type constructions for resolvable group‐divisible designs
- On the Hamilton–Waterloo Problem with Odd Orders
- The Hamilton-Waterloo problem for triangle-factors and heptagon-factors
This page was built for publication: Completing the spectrum of almost resolvable cycle systems with odd cycle length
