The Oberwolfach problem and factors of uniform odd length cycles
From MaRDI portal
Publication:1825209
DOI10.1016/0097-3165(89)90059-9zbMath0684.05035OpenAlexW1979984579MaRDI QIDQ1825209
David G. Wagner, Douglas R. Stinson, Paul J. Schellenberg, Brian Alspach
Publication date: 1989
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(89)90059-9
Related Items (76)
On the Oberwolfach problem for single-flip 2-factors via graceful labelings ⋮ The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors ⋮ \(C_7\)-decompositions of the tensor product of complete graphs ⋮ Unnamed Item ⋮ \(C_{p}\)-decompositions of some regular graphs ⋮ On bipartite 2-factorizations of kn − I and the Oberwolfach problem ⋮ The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles ⋮ On 2-factorizations of the complete graph: From thek-pyramidal to the universal property ⋮ On the existence of unparalleled even cycle systems ⋮ Note on three table Oberwolfach problem ⋮ On the Oberwolfach problem for complete multigraphs ⋮ Merging Combinatorial Design and Optimization: the Oberwolfach Problem ⋮ The generalised Oberwolfach problem ⋮ Decompositions of regular graphs into \(K^ c_ n \vee 2K_ 2\) ⋮ A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors ⋮ A complete solution to the two-table Oberwolfach problems ⋮ A greedy algorithm for the social golfer and the Oberwolfach problem ⋮ Orthogonally Resolvable Cycle Decompositions ⋮ Block colourings of star systems ⋮ Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem ⋮ Almost resolvable maximum packings of complete graphs with 5-cycles ⋮ On the directed Oberwolfach problem with equal cycle lengths ⋮ On the existence of k $k$‐cycle semiframes for even k $k$ ⋮ On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles ⋮ Unnamed Item ⋮ The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs. ⋮ Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment ⋮ Uniformly resolvable cycle decompositions with four different factors ⋮ Completing the solution of the directed Oberwolfach problem with cycles of equal length ⋮ A constructive solution to the Oberwolfach problem with a large cycle ⋮ On the existence of cycle frames and almost resolvable cycle systems ⋮ Completing the spectrum of almost resolvable cycle systems with odd cycle length ⋮ A survey on the existence ofG-Designs ⋮ Existence of resolvable path designs ⋮ On resolvable mixed path designs ⋮ The generalized almost resolvable cycle system problem ⋮ The energy of a graph ⋮ On the existence of holey 4-cycle frames ⋮ A brief review on Egmont Köhler's mathematical work ⋮ The existence of \(C_ k\)-factorizations of \(K_{2n}-F\) ⋮ The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors ⋮ Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem ⋮ Decomposing certain equipartite graphs into sunlet graphs of length \(2p\) ⋮ 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 ⋮ Pack graphs with subgraphs of size three ⋮ Almost resolvable cycle systems-an analogue of Hanani triple systems ⋮ Hamilton cycle rich 2-factorizations of complete multipartite graphs ⋮ On decomposition of the Cartesian product of directed cycles into cycles of equal lengths ⋮ More results on cycle frames and almost resolvable cycle systems ⋮ Resolvable even cycle decompositions of the tensor product of complete graphs ⋮ Regular Oberwolfach problems and group sequencings ⋮ Zero-sum flows for triple systems ⋮ The Hamilton-Waterloo problem for triangle-factors and heptagon-factors ⋮ Resolution of the Oberwolfach problem ⋮ Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices ⋮ The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle ⋮ Unnamed Item ⋮ Factorizations of product graphs into cycles of uniform length ⋮ On the generalized Oberwolfach problem ⋮ On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity ⋮ On the directed Oberwolfach Problem with equal cycle lengths: the odd case ⋮ Unnamed Item ⋮ Bipartite 2‐Factorizations of Complete Multipartite Graphs ⋮ Almost resolvable decompositions of \(2K_ n\) into cycles of odd length ⋮ On a generalization of the Oberwolfach problem ⋮ The Hamilton-Waterloo problem with even cycle lengths ⋮ Complete solutions to the Oberwolfach problem for an infinite set of orders ⋮ On sharply vertex transitive 2-factorizations of the complete graph ⋮ Pancomponented 2-factorizations of complete graphs ⋮ Brian Alspach and his work ⋮ Unnamed Item ⋮ Factorizations of complete graphs into cycles and 1-factors ⋮ Near 2-factorizations of \(2K_ n:\) Cycles of even length ⋮ The equipartite Oberwolfach problem with uniform tables
Cites Work
- Frames for Kirkman triple systems
- On a variation of the Oberwolfach problem
- Hamiltonian decomposition of lexicographic product
- Some results on the Oberwolfach problem. (Decomposition of complete graphs into isomorphic quadratic factors.)
- Some observations on the oberwolfach problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The Oberwolfach problem and factors of uniform odd length cycles
