A complete solution to the infinite Oberwolfach problem
From MaRDI portal
Publication:6187427
DOI10.1002/jcd.21702arXiv1810.02982OpenAlexW3005256124MaRDI QIDQ6187427
Publication date: 31 January 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.02982
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A complete solution to the two-table Oberwolfach problems
- Graph products and new solutions to Oberwolfach problems
- Abelian 1-factorizations in infinite graphs
- On the existence of nearly Kirkman triple systems with subsystems
- Complete solutions to the Oberwolfach problem for an infinite set of orders
- Frames for Kirkman triple systems
- On \(\lambda\)-fold equipartite Oberwolfach problem with uniform table sizes
- Resolution of the Oberwolfach problem
- Resolvability of infinite designs
- On sharply vertex transitive 2-factorizations of the complete graph
- Some new results on 1-rotational 2-factorizations of the complete graph
- On bipartite 2-factorizations of kn − I and the Oberwolfach problem
- 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem
- Merging Combinatorial Design and Optimization: the Oberwolfach Problem
- 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
- On the cyclic decompositions of the complete graph into polygons with odd number of edges
This page was built for publication: A complete solution to the infinite Oberwolfach problem
