Near 2-factorizations of 2K_ n: Cycles of even length
From MaRDI portal
Publication:805635
Recommendations
Cites work
- scientific article; zbMATH DE number 3922666 (Why is no real title available?)
- scientific article; zbMATH DE number 3950583 (Why is no real title available?)
- Almost resolvable decomposition of K//n*
- Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
- Nesting and almost resolvability of pentagon systems
- On a variation of the Oberwolfach problem
- On resolvable balanced incomplete block designs
- Some observations on the oberwolfach problem
- The Oberwolfach problem and factors of uniform odd length cycles
Cited in
(14)- Equitable block-colorings of \(C_4\)-decompositions of \(K_v-F\)
- Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
- Note on three table Oberwolfach problem
- \(C_{4p}\)-frame of complete multipartite multigraphs
- Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem
- Combinatorial properties of strength groups in round robin tournaments
- scientific article; zbMATH DE number 7593862 (Why is no real title available?)
- (1, 2)-Factorizations of General Eulerian Nearly Regular Graphs
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
- On the existence of cycle frames and almost resolvable cycle systems
- 4-cycle systems of \(K_n-E(F^\ast)\)
- Cycle frames of complete multipartite multigraphs. III
- scientific article; zbMATH DE number 1286743 (Why is no real title available?)
- scientific article; zbMATH DE number 1802824 (Why is no real title available?)
This page was built for publication: Near 2-factorizations of \(2K_ n:\) Cycles of even length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805635)