Some observations on the oberwolfach problem
From MaRDI portal
Publication:3739152
Recommendations
Cited in
(43)- Brian Alspach and his work
- Pack graphs with subgraphs of size three
- Solutions to the Oberwolfach problem for orders up to 100
- 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
- A brief review on Egmont Köhler's mathematical work
- Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment
- On resolvable mixed path designs
- On the Hamilton-Waterloo problem with cycle lengths of distinct parities
- On the Oberwolfach problem for single-flip 2-factors via graceful labelings
- The Oberwolfach problem with loving couples
- Near 2-factorizations of \(2K_ n:\) Cycles of even length
- scientific article; zbMATH DE number 5917757 (Why is no real title available?)
- Decomposition of complete graphs into cycles and stars
- Pancomponented 2-factorizations of complete graphs
- scientific article; zbMATH DE number 2064044 (Why is no real title available?)
- 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
- Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
- Remarks on a Problem of Obreanu
- The solution of the bipartite analogue of the Oberwolfach problem
- Merging combinatorial design and optimization: the Oberwolfach problem
- On bipartite 2-factorizations of \(K_{n} - I\) and 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 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
- Completing the spectrum of almost resolvable cycle systems with odd cycle length
- On the directed Oberwolfach Problem with equal cycle lengths: the odd case
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)