A complete solution to the two-table Oberwolfach problems
From MaRDI portal
Publication:385030
DOI10.1016/j.jcta.2013.01.003zbMath1277.05143OpenAlexW2048156596MaRDI QIDQ385030
Publication date: 29 November 2013
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2013.01.003
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph theory (05C99)
Related Items (30)
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 ⋮ Octahedral, dicyclic and special linear solutions of some Hamilton-Waterloo problems ⋮ Unnamed Item ⋮ On the existence of unparalleled even cycle systems ⋮ Note on three table Oberwolfach problem ⋮ Merging Combinatorial Design and Optimization: the Oberwolfach Problem ⋮ Unnamed Item ⋮ The generalised Oberwolfach problem ⋮ Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles ⋮ On Decomposing the Complete Graph into the Union of Two Disjoint Cycles ⋮ Orthogonally Resolvable Cycle Decompositions ⋮ On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles ⋮ 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 ⋮ On the Hamilton-Waterloo problem with cycle lengths of distinct parities ⋮ Cyclic uniform 2-factorizations of the complete multipartite graph ⋮ Products of graceful bipartite graphs ⋮ 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 Hamilton-Waterloo problem: the case of two cycles sizes of different parity ⋮ The Hamilton-Waterloo problem with even cycle lengths ⋮ Cycle frames and the Oberwolfach problem ⋮ Unnamed Item ⋮ The structure of 2-pyramidal 2-factorizations ⋮ Graceful labeling for mushroom trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph products and new solutions to Oberwolfach problems
- Complete solutions to the Oberwolfach problem for an infinite set of orders
- A non-existence result on cyclic cycle-decompositions of the cocktail party graph
- From graceful labellings of paths to cyclic solutions of the Oberwolfach problem
- On a variation of the Oberwolfach problem
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
- \(G\)-invariantly resolvable Steiner 2-designs which are 1-rotational over \(G\)
- Graceful labelling of the union of paths and cycles
- On the Oberwolfach problem for complete multigraphs
- Cyclic Hamiltonian cycle systems of the complete graph.
- Sectionable terraces and the (generalised) Oberwolfach problem
- The Oberwolfach problem and factors of uniform odd length cycles
- Some constructions for cyclic perfect cycle systems
- Some cyclic solutions to the three table Oberwolfach problem
- Some new results on 1-rotational 2-factorizations of the complete graph
- SOME RESULTS ON THE OBERWOLFACH PROBLEM
- On bipartite 2-factorizations of kn − I and the Oberwolfach problem
- On 2-factorizations of the complete graph: From thek-pyramidal to the universal property
- 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem
- 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
This page was built for publication: A complete solution to the two-table Oberwolfach problems
