A survey on constructive methods for the Oberwolfach problem and its variants
From MaRDI portal
Publication:6613359
DOI10.1007/978-3-031-48679-1_3zbMATH Open1548.05266MaRDI QIDQ6613359
Tommaso Traetta, Andrea C. Burgess, Peter H. Danziger
Publication date: 2 October 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decompositions of complete graphs into bipartite 2-regular subgraphs
- A complete solution to the two-table Oberwolfach problems
- On the directed Oberwolfach problem with equal cycle lengths
- Graph products and new solutions to Oberwolfach problems
- Decompositions of complete multigraphs into cycles of varying lengths
- Hamilton decomposable graphs with specified leaves
- Hamiltonian decompositions of complete graphs
- Complete solutions to the Oberwolfach problem for an infinite set of orders
- A non-existence result on cyclic cycle-decompositions of the cocktail party graph
- From graceful labellings of paths to cyclic solutions of the Oberwolfach problem
- Hamiltonian decomposition of Cayley graphs of degree 4
- On a variation of the Oberwolfach problem
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
- The solution of the bipartite analogue of the Oberwolfach problem
- Resolvable decomposition of \(K^*_n\)
- \(G\)-invariantly resolvable Steiner 2-designs which are 1-rotational over \(G\)
- On the Hamilton-Waterloo problem
- The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs.
- Two-factorizations of small complete graphs
- Resolvable perfect Mendelsohn designs with block size five
- Uniformly resolvable cycle decompositions with four different factors
- On the Hamilton-Waterloo problem with cycle lengths of distinct parities
- Sectionable terraces and the (generalised) Oberwolfach problem
- The Oberwolfach problem and factors of uniform odd length cycles
- On a generalization of the Oberwolfach problem
- The equipartite Oberwolfach problem with uniform tables
- Resolution of the Oberwolfach problem
- On the Oberwolfach problem for single-flip 2-factors via graceful labelings
- Resolvable Mendelsohn designs with block size 4
- The Hamilton-Waterloo problem with even cycle lengths
- The structure of 2-pyramidal 2-factorizations
- On sharply vertex transitive 2-factorizations of the complete graph
- Some constructions for cyclic perfect cycle systems
- Some cyclic solutions to the three table Oberwolfach problem
- The generalised Oberwolfach problem
- Some problems about \(r\)-factorizations of complete graphs
- Explicit constructions for 1-rotational Kirkman triple systems
- On the Hamilton-Waterloo Problem with triangle factors and $C_{3x}$-factors
- On factorisations of complete graphs into circulant graphs and the Oberwolfach problem
- SOME RESULTS ON THE OBERWOLFACH PROBLEM
- On bipartite 2-factorizations of kn − I and the Oberwolfach problem
- Octahedral, dicyclic and special linear solutions of some Hamilton-Waterloo problems
- On 2-factorizations of the complete graph: From thek-pyramidal to the universal property
- Asymptotic Existence of Resolvable Graph Designs
- The Hamilton-Waterloo problem for cycle sizes 3 and 4
- Some observations on the oberwolfach problem
- Hamilton cycle rich two-factorizations of complete graphs
- The Hamilton-Waterloo Problem for C3-Factors and Cn-Factors
- On the directed Oberwolfach Problem with equal cycle lengths: the odd case
- A method to construct 1‐rotational factorizations of complete graphs and solutions to the oberwolfach problem
- Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem
- On the Hamilton–Waterloo problem with odd cycle lengths
- A generalization of the Oberwolfach problem
- 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem
- On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors
- Cycle decompositions V: Complete graphs into cycles of arbitrary lengths
- Bipartite 2‐Factorizations of Complete Multipartite Graphs
- Merging Combinatorial Design and Optimization: the Oberwolfach Problem
- On the generalized Oberwolfach problem
- On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity
- On the spouse‐loving variant of the Oberwolfach problem
- On the Hamilton–Waterloo Problem with Odd Orders
- 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
- The Hamilton-Waterloo problem for triangle-factors and heptagon-factors
- Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment
- Solution to the outstanding case of the spouse‐loving variant of the Oberwolfach problem with uniform cycle length
This page was built for publication: A survey on constructive methods for the Oberwolfach problem and its variants
