Some observations on the oberwolfach problem

DOI10.1002/JGT.3190090114zbMATH Open0603.05032OpenAlexW1977067446MaRDI QIDQ3739152FDOQ3739152

Authors: Brian Alspach, Roland Häggkvist 

Publication date: 1985

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190090114

Recommendations

• A generalization of the Oberwolfach problem
• scientific article; zbMATH DE number 3950583
• The solution of the bipartite analogue of the Oberwolfach problem
• Hamilton cycle rich two-factorizations of complete graphs
• scientific article; zbMATH DE number 3922695

zbMATH Keywords

decompositions of graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Cited In (43)

• Brian Alspach and his work
• Solutions to the Oberwolfach problem for orders up to 100
• Pack graphs with subgraphs of size three
• On the Hamilton-Waterloo problem for bipartite 2-factors
• The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs.
• On the directed Oberwolfach problem with equal cycle lengths
• Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment
• A brief review on Egmont Köhler's mathematical work
• On resolvable mixed path designs
• The Oberwolfach problem with loving couples
• On the Hamilton-Waterloo problem with cycle lengths of distinct parities
• On the Oberwolfach problem for single-flip 2-factors via graceful labelings
• Near 2-factorizations of \(2K_ n:\) Cycles of even length
• Title not available (Why is that?)
• Decomposition of complete graphs into cycles and stars
• Title not available (Why is that?)
• Pancomponented 2-factorizations of complete graphs
• Complete solutions to the Oberwolfach problem for an infinite set of orders
• Zero-sum flows for triple systems
• A survey on constructive methods for the Oberwolfach problem and its variants
• On the minisymposium problem
• Remarks on a Problem of Obreanu
• Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
• Merging combinatorial design and optimization: the Oberwolfach problem
• The solution of the bipartite analogue of the Oberwolfach problem
• Completing the solution of the directed Oberwolfach problem with cycles of equal length
• Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem
• On the generalized Oberwolfach problem
• On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
• On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles
• Uniformly resolvable \({P_4, C_k}\)-decomposition of \(K_n\) -- a complete solution
• Regular Oberwolfach problems and group sequencings
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• Orthogonally resolvable cycle decompositions
• On the Oberwolfach problem for complete multigraphs
• The Hamilton-Waterloo problem for triangle-factors and heptagon-factors
• Uniformly resolvable decompositions of \(K_v\) in 1-factors and 4-stars
• The Oberwolfach problem and factors of uniform odd length cycles
• On a generalization of the Oberwolfach problem
• On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity
• On decomposition of the Cartesian product of directed cycles into cycles of equal lengths
• On the directed Oberwolfach Problem with equal cycle lengths: the odd case
• Completing the spectrum of almost resolvable cycle systems with odd cycle length

This page was built for publication: Some observations on the oberwolfach problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3739152)