Near 2-factorizations of 2K_ n: Cycles of even length
A near 2-factor in a graph G is a subgraph in which each vertex, except for one vertex of degree zero, has degree 2. A t-uniform near 2- factorization of \(2K_ m\) (two edges between every pair of distinct vertices) is a partition of \(E(2K_ m)\) into near 2-factors all of whose cycles have length t. The authors prove that \(2K_ m\) has a t-uniform near 2-factorization if and only if \(m\equiv l(mod t)\), whenever t is even. They also consider 4-uniform near 2-factorizations of \(2K_ m\) with the property that if one of the near 2-factors is known, all others can easily be generated from it. They find infinitely many m for which there are such 4-uniform near 2-factorizations.
- Almost resolvable decomposition of K//n*
- Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
- scientific article; zbMATH DE number 3922666 (Why is no real title available?)
- scientific article; zbMATH DE number 3950583 (Why is no real title available?)
- 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
- Combinatorial properties of strength groups in round robin tournaments
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
- Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
- \(C_{4p}\)-frame of complete multipartite multigraphs
- Equitable block-colorings of \(C_4\)-decompositions of \(K_v-F\)
- Cycle frames of complete multipartite multigraphs. III
- scientific article; zbMATH DE number 1802824 (Why is no real title available?)
- Note on three table Oberwolfach problem
- scientific article; zbMATH DE number 1286743 (Why is no real title available?)
- (1, 2)-Factorizations of General Eulerian Nearly Regular Graphs
- Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem
- 4-cycle systems of \(K_n-E(F^\ast)\)
- scientific article; zbMATH DE number 7593862 (Why is no real title available?)
- On the existence of cycle frames and almost resolvable cycle systems
- Almost resolvable even cycle decompositions of ( K_u K_g)()
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)
