Complete solutions to the Oberwolfach problem for an infinite set of orders
From MaRDI portal
Publication:1044208
DOI10.1016/j.jctb.2009.03.003zbMath1218.05121OpenAlexW2002197583MaRDI QIDQ1044208
Victor Scharaschkin, Darryn E. Bryant
Publication date: 11 December 2009
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2009.03.003
Related Items
On the Oberwolfach problem for single-flip 2-factors via graceful labelings, Decompositions of complete graphs into bipartite 2-regular subgraphs, A cyclic solution for an infinite class of Hamilton-Waterloo problems, Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles, Packing spanning graphs from separable families, Hamilton cycle rich 2-factorization of complete bipartite graphs, On bipartite 2-factorizations of kn − I and the Oberwolfach problem, Octahedral, dicyclic and special linear solutions of some Hamilton-Waterloo problems, On the existence of unparalleled even cycle systems, Note on three table Oberwolfach problem, Merging Combinatorial Design and Optimization: the Oberwolfach Problem, The generalised Oberwolfach problem, A complete solution to the two-table Oberwolfach problems, Orthogonally Resolvable Cycle Decompositions, 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, A blow-up lemma for approximate decompositions, 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem, On the Hamilton-Waterloo problem with cycle lengths of distinct parities, On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors, Zero-sum flows for triple systems, Resolution of the Oberwolfach problem, Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices, On the generalized Oberwolfach problem, On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity, Bipartite 2‐Factorizations of Complete Multipartite Graphs, The Hamilton-Waterloo problem with even cycle lengths, Unnamed Item, The structure of 2-pyramidal 2-factorizations
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
- On a variation of the Oberwolfach problem
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
- On the Oberwolfach problem for complete multigraphs
- Two-factorizations of small complete graphs
- The Oberwolfach problem and factors of uniform odd length cycles
- Some cyclic solutions to the three table Oberwolfach problem
- SOME RESULTS ON THE OBERWOLFACH PROBLEM
- Some observations on the oberwolfach problem
- On the Oberwolfach problem with two similar length cycles
