Near 2-factorizations of \(2K_ n:\) Cycles of even length

DOI10.1007/BF01788673zbMath0729.05039WikidataQ114233925 ScholiaQ114233925MaRDI QIDQ805635

Katherine Heinrich, James P. Burling

Publication date: 1989

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

near 2-factort-uniform near 2-factorization of \(2K_ m\)

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (10)

Equitable block-colorings of \(C_4\)-decompositions of \(K_v-F\) ⋮ \(C_{4p}\)-frame of complete multipartite multigraphs ⋮ Note on three table Oberwolfach problem ⋮ Cycle Frames of Complete Multipartite Multigraphs - III ⋮ Unnamed Item ⋮ On the existence of cycle frames and almost resolvable cycle systems ⋮ 4-cycle systems of \(K_n-E(F^\ast)\) ⋮ Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem ⋮ Combinatorial properties of strength groups in round robin tournaments ⋮ Almost resolvable decompositions of \(2K_ n\) into cycles of odd length

Cites Work

• Unnamed Item
• Unnamed Item
• On a variation of the Oberwolfach problem
• On resolvable balanced incomplete block designs
• The Oberwolfach problem and factors of uniform odd length cycles
• Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
• Almost resolvable decomposition of K//n*
• Nesting and almost resolvability of pentagon systems
• Some observations on the oberwolfach problem

This page was built for publication: Near 2-factorizations of \(2K_ n:\) Cycles of even length