On the existence of cycle frames and almost resolvable cycle systems
From MaRDI portal
Publication:641197
DOI10.1016/J.DISC.2011.07.008zbMath1293.05031OpenAlexW2064948589MaRDI QIDQ641197
Publication date: 21 October 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.07.008
Related Items (14)
\(C_{4p}\)-frame of complete multipartite multigraphs ⋮ Internally fair factorizations and internally fair holey factorizations with prescribed regularity ⋮ Cycle Frames of Complete Multipartite Multigraphs - III ⋮ A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors ⋮ Almost resolvable maximum packings of complete graphs with 5-cycles ⋮ On the existence of k $k$‐cycle semiframes for even k $k$ ⋮ Unnamed Item ⋮ Completing the spectrum of almost resolvable cycle systems with odd cycle length ⋮ On the existence of holey 4-cycle frames ⋮ Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem ⋮ More results on cycle frames and almost resolvable cycle systems ⋮ Six-cycle systems ⋮ Cycle frames and the Oberwolfach problem ⋮ Fair holey Hamiltonian decompositions of complete multipartite graphs and long cycle frames
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hanani triple systems
- Resolvable group divisible designs with block size 3
- Near 2-factorizations of \(2K_ n:\) Cycles of even length
- Kirkman frames having hole type \(h^u m^1\) for small \(h\)
- Frames for Kirkman triple 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
- Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- The equipartite Oberwolfach problem with uniform tables
- Resolvable 4-cycle group divisible designs with two associate classes: part size even
- Cycle decompositions III: Complete graphs and fixed length cycles
- Almost resolvable cycle systems-an analogue of Hanani triple systems
- Two new direct product‐type constructions for resolvable group‐divisible designs
This page was built for publication: On the existence of cycle frames and almost resolvable cycle systems