On the generalized Oberwolfach problem
DOI10.26493/1855-3974.1426.212zbMATH Open1433.05257OpenAlexW2949183821WikidataQ127632193 ScholiaQ127632193MaRDI QIDQ5217059FDOQ5217059
Authors: Peter Danziger, Tommaso Traetta, Andrea Burgess
Publication date: 21 February 2020
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.1426.212
Recommendations
Hamilton-Waterloo problem2-factorizationscycle systemsgeneralized Oberwolfach problemresolvable cycle decompositions
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)
Cites Work
- Title not available (Why is that?)
- Complete solutions to the Oberwolfach problem for an infinite set of orders
- On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
- Two-factorizations of small complete graphs
- The equipartite Oberwolfach problem with uniform tables
- A cyclic solution for an infinite class of Hamilton-Waterloo problems
- The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
- Title not available (Why is that?)
- Bipartite 2-factorizations of complete multipartite graphs
- Two-factorisations of complete graphs of orders fifteen and seventeen
- Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
- On the Hamilton-Waterloo problem with odd orders
- A course on finite groups.
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
- The Oberwolfach problem and factors of uniform odd length cycles
- 2-starters, graceful labelings, and a doubling construction for the Oberwolfach problem
- A Combinatorial Problem on Abelian Groups
- Some observations on the oberwolfach problem
- Hamilton cycle rich two-factorizations of complete graphs
- On the Hamilton-Waterloo problem for bipartite 2-factors
- Resolution of the Oberwolfach problem
- The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs.
- Uniformly resolvable cycle decompositions with four different factors
- On a generalization of the Oberwolfach problem
- On the Hamilton-Waterloo problem with triangle factors and \(C_{3x}\)-factors
- A generalization of the Hamilton-Waterloo problem on complete equipartite graphs
- On the Hamilton-Waterloo problem with odd cycle lengths
- A generalization of the Oberwolfach problem
Cited In (10)
- Title not available (Why is that?)
- A survey on constructive methods for the Oberwolfach problem and its variants
- Title not available (Why is that?)
- Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem
- On the Hamilton-Waterloo problem
- Title not available (Why is that?)
- Resolution of the Oberwolfach problem
- Resolution of the Oberwolfach problem
- On a generalization of the Oberwolfach problem
- Title not available (Why is that?)
This page was built for publication: On the generalized Oberwolfach problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5217059)