The structure of 2-pyramidal 2-factorizations
From MaRDI portal
Publication:2345518
DOI10.1007/s00373-014-1408-2zbMath1312.05112OpenAlexW2316405649WikidataQ114229670 ScholiaQ114229670MaRDI QIDQ2345518
Tommaso Traetta, Marco Buratti
Publication date: 22 May 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1408-2
Related Items (5)
On the Oberwolfach problem for single-flip 2-factors via graceful labelings ⋮ Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles ⋮ On the existence of unparalleled even cycle systems ⋮ Merging Combinatorial Design and Optimization: the Oberwolfach Problem ⋮ A constructive solution to the Oberwolfach problem with a large cycle
Cites Work
- 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
- 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
- \(G\)-invariantly resolvable Steiner 2-designs which are 1-rotational over \(G\)
- Cyclic Hamiltonian cycle systems of the complete graph.
- Sectionable terraces and the (generalised) Oberwolfach problem
- \(\phi\)-symmetric Hamilton cycle decompositions of graphs
- On sharply vertex transitive 2-factorizations of the complete graph
- Some constructions for cyclic perfect cycle systems
- Some cyclic solutions to the three table Oberwolfach problem
- Hamiltonian Cycle Systems Which Are Both Cyclic and Symmetric
- Some new results on 1-rotational 2-factorizations of the complete graph
- Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor
- 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
- Every finite solvable group with a unique element of order two, except the quaternion group, has a symmetric sequencing
- 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem
- Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph
- Some Results on 1‐Rotational Hamiltonian Cycle Systems
- 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
- Regular Oberwolfach problems and group sequencings
This page was built for publication: The structure of 2-pyramidal 2-factorizations
