Near 2-factorizations of 2K_ n: Cycles of even length
From MaRDI portal
Publication:805635
DOI10.1007/BF01788673zbMATH Open0729.05039WikidataQ114233925 ScholiaQ114233925MaRDI QIDQ805635FDOQ805635
Authors: James P. Burling, Katherine Heinrich
Publication date: 1989
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Recommendations
Cites Work
- Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
- On a variation of the Oberwolfach problem
- The Oberwolfach problem and factors of uniform odd length cycles
- Some observations on the oberwolfach problem
- On resolvable balanced incomplete block designs
- Nesting and almost resolvability of pentagon systems
- Almost resolvable decomposition of K//n*
- Title not available (Why is that?)
- Title not available (Why is that?)
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
- Title not available (Why is that?)
- Combinatorial properties of strength groups in round robin tournaments
- (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
- Title not available (Why is that?)
- Title not available (Why is that?)
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)