2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem
From MaRDI portal
Publication:4906042
DOI10.1002/jcd.21296zbMath1258.05099OpenAlexW1945346921MaRDI QIDQ4906042
Tommaso Traetta, Marco Buratti
Publication date: 21 February 2013
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.21296
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (12)
On the Oberwolfach problem for single-flip 2-factors via graceful labelings ⋮ On the existence of unparalleled even cycle systems ⋮ Note on three table Oberwolfach problem ⋮ Merging Combinatorial Design and Optimization: the Oberwolfach Problem ⋮ A complete solution to the two-table Oberwolfach problems ⋮ Orthogonally Resolvable Cycle Decompositions ⋮ A complete solution to the infinite Oberwolfach problem ⋮ A constructive solution to the Oberwolfach problem with a large cycle ⋮ Zero-sum flows for triple systems ⋮ On the generalized Oberwolfach problem ⋮ Some Results on 1‐Rotational Hamiltonian Cycle Systems ⋮ The structure of 2-pyramidal 2-factorizations
Cites Work
- 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\)
- 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
- Existence of cyclic \(k\)-cycle systems of the complete graph
- Graceful valuations of 2-regular graphs with two components
- 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
- 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
- On the Oberwolfach problem with two similar length cycles
This page was built for publication: 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem
