The Oberwolfach problem and factors of uniform odd length cycles

DOI10.1016/0097-3165(89)90059-9zbMath0684.05035MaRDI QIDQ1825209

David G. Wagner, Brian Alspach, Douglas R. Stinson, Paul J. Schellenberg

Publication date: 1989

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(89)90059-9

zbMATH Keywords

2-factorization; Oberwolfach problem

Mathematics Subject Classification ID

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

Related Items

Unnamed Item, 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem, On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors, Bipartite 2‐Factorizations of Complete Multipartite Graphs, Regular Oberwolfach problems and group sequencings, The Hamilton-Waterloo problem for triangle-factors and heptagon-factors, On the existence of unparalleled even cycle systems, Note on three table Oberwolfach problem, A complete solution to the two-table Oberwolfach problems, On the directed Oberwolfach problem with equal cycle lengths, On the existence of holey 4-cycle frames, The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors, Decomposing certain equipartite graphs into sunlet graphs of length \(2p\), On the existence of cycle frames and almost resolvable cycle systems, The generalized almost resolvable cycle system problem, More results on cycle frames and almost resolvable cycle systems, Zero-sum flows for triple systems, Near 2-factorizations of \(2K_ n:\) Cycles of even length, Almost resolvable maximum packings of complete graphs with 5-cycles, Existence of resolvable path designs, On resolvable mixed path designs, Complete solutions to the Oberwolfach problem for an infinite set of orders, A brief review on Egmont Köhler's mathematical work, The existence of \(C_ k\)-factorizations of \(K_{2n}-F\), On the Oberwolfach problem for complete multigraphs, The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs., The energy of a graph, Factorizations of product graphs into cycles of uniform length, Almost resolvable decompositions of \(2K_ n\) into cycles of odd length, On a generalization of the Oberwolfach problem, The equipartite Oberwolfach problem with uniform tables, The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors, Decompositions of regular graphs into \(K^ c_ n \vee 2K_ 2\), On decomposition of the Cartesian product of directed cycles into cycles of equal lengths, Resolvable even cycle decompositions of the tensor product of complete graphs, \(C_7\)-decompositions of the tensor product of complete graphs, \(C_{p}\)-decompositions of some regular graphs, A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors, Hamilton cycle rich 2-factorizations of complete multipartite graphs, Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices, On sharply vertex transitive 2-factorizations of the complete graph, Pancomponented 2-factorizations of complete graphs, Brian Alspach and his work, The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles, Orthogonally Resolvable Cycle Decompositions, On bipartite 2-factorizations of kn − I and the Oberwolfach problem, On 2-factorizations of the complete graph: From thek-pyramidal to the universal property, A survey on the existence ofG-Designs, Almost resolvable cycle systems-an analogue of Hanani triple systems, The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle

Cites Work