Merging Combinatorial Design and Optimization: the Oberwolfach Problem
From MaRDI portal
Publication:4990113
zbMath1465.05147arXiv1903.12112MaRDI QIDQ4990113
Marco Buratti, Fabio Salassa, Gabriele Dragotto, Tommaso Traetta, Frederico Della Croce
Publication date: 28 May 2021
Full work available at URL: https://arxiv.org/abs/1903.12112
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
On the Oberwolfach problem for single-flip 2-factors via graceful labelings ⋮ A greedy algorithm for the social golfer and the Oberwolfach problem ⋮ On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles ⋮ Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment ⋮ A complete solution to the infinite Oberwolfach problem ⋮ A constructive solution to the Oberwolfach problem with a large cycle ⋮ Resolution of the Oberwolfach problem
Cites Work
- A complete solution to the two-table Oberwolfach problems
- The table placement problem: a research challenge at the EWI 2007
- 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
- On a variation of the Oberwolfach problem
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
- The solution of the bipartite analogue of the Oberwolfach problem
- The Oberwolfach problem and factors of uniform odd length cycles
- The structure of 2-pyramidal 2-factorizations
- On sharply vertex transitive 2-factorizations of the complete graph
- SOME RESULTS ON THE OBERWOLFACH PROBLEM
- On bipartite 2-factorizations of kn − I and the Oberwolfach problem
- Some observations on the oberwolfach problem
- 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem
- 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Merging Combinatorial Design and Optimization: the Oberwolfach Problem