On a variation of the Oberwolfach problem
From MaRDI portal
Publication:1140095
DOI10.1016/0012-365X(79)90162-6zbMath0435.05038OpenAlexW2018159099MaRDI QIDQ1140095
Charlotte Huang, Alexander Rosa, Anton Kotzig
Publication date: 1979
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(79)90162-6
Related Items (30)
On the Oberwolfach problem for single-flip 2-factors via graceful labelings ⋮ The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors ⋮ Unnamed Item ⋮ Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles ⋮ On bipartite 2-factorizations of kn − I and the Oberwolfach problem ⋮ Note on three table Oberwolfach problem ⋮ Ascending subgraph decompositions of oriented graphs that factor into triangles ⋮ On the Oberwolfach problem for complete multigraphs ⋮ Merging Combinatorial Design and Optimization: the Oberwolfach Problem ⋮ The impact of emigration on Slovak mathematics: the case of the Bratislava graph theory seminar ⋮ A complete solution to the two-table Oberwolfach problems ⋮ On the directed Oberwolfach problem with equal cycle lengths ⋮ On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles ⋮ 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 resolvable mixed path designs ⋮ A brief review on Egmont Köhler's mathematical work ⋮ The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors ⋮ 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem ⋮ On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors ⋮ Regular Oberwolfach problems and group sequencings ⋮ Resolution of the Oberwolfach problem ⋮ The Oberwolfach problem and factors of uniform odd length cycles ⋮ Almost resolvable decompositions of \(2K_ n\) into cycles of odd length ⋮ On a generalization of the Oberwolfach problem ⋮ Complete solutions to the Oberwolfach problem for an infinite set of orders ⋮ Spanning cubic graph designs ⋮ The structure of 2-pyramidal 2-factorizations ⋮ Near 2-factorizations of \(2K_ n:\) Cycles of even length ⋮ The equipartite Oberwolfach problem with uniform tables
Cites Work
- Some results on the Oberwolfach problem. (Decomposition of complete graphs into isomorphic quadratic factors.)
- On the existence of automorphism free Steiner triple systems
- Parallel concepts in graph theory
- On Partially Resolvable t–Partitions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On a variation of the Oberwolfach problem
