Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
From MaRDI portal
Publication:1825884
DOI10.1016/0097-3165(88)90053-2zbMath0685.05035OpenAlexW1996907094MaRDI QIDQ1825884
Katherine Heinrich, C. A. Rodger, Charles C. Lindner
Publication date: 1988
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(88)90053-2
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (9)
Equitable block-colorings of \(C_4\)-decompositions of \(K_v-F\) ⋮ \(C_{4p}\)-frame of complete multipartite multigraphs ⋮ Small embeddings for partial cycle systems of odd length ⋮ Note on three table Oberwolfach problem ⋮ Unnamed Item ⋮ On the existence of cycle frames and almost resolvable cycle systems ⋮ Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem ⋮ On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\) ⋮ Near 2-factorizations of \(2K_ n:\) Cycles of even length
Cites Work
- Nesting of cycle systems of odd length
- Near 2-factorizations of \(2K_ n:\) Cycles of even length
- The spectrum of nested Steiner triple systems
- On a variation of the Oberwolfach problem
- Resolvable perfect cyclic designs
- Some results on the Oberwolfach problem. (Decomposition of complete graphs into isomorphic quadratic factors.)
- The Oberwolfach problem and factors of uniform odd length cycles
- Almost resolvable decomposition of K//n*
- Nesting and almost resolvability of pentagon systems
- Some observations on the oberwolfach problem
- On Partially Resolvable t–Partitions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
