The Oberwolfach problem with loving couples
From MaRDI portal
Publication:6584899
DOI10.1002/JCD.21946zbMATH Open1542.05024MaRDI QIDQ6584899
Publication date: 8 August 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A complete solution to the two-table Oberwolfach problems
- On 2-pyramidal Hamiltonian cycle systems
- Graph products and new solutions to Oberwolfach problems
- 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\)
- Two-factorizations of small complete graphs
- Sectionable terraces and the (generalised) Oberwolfach problem
- The Oberwolfach problem and factors of uniform odd length cycles
- Resolution of the Oberwolfach problem
- On the Oberwolfach problem for single-flip 2-factors via graceful labelings
- The structure of 2-pyramidal 2-factorizations
- Some cyclic solutions to the three table Oberwolfach problem
- Explicit constructions for 1-rotational Kirkman triple systems
- Some new results on 1-rotational 2-factorizations of the complete graph
- 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
- Some observations on the oberwolfach problem
- 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem
- Some Results on 1‐Rotational Hamiltonian Cycle Systems
- Merging Combinatorial Design and Optimization: the Oberwolfach Problem
- On the honeymoon Oberwolfach problem
- On the spouse‐loving variant of the Oberwolfach problem
- 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
- Regular Oberwolfach problems and group sequencings
- Solution to the outstanding case of the spouse‐loving variant of the Oberwolfach problem with uniform cycle length
This page was built for publication: The Oberwolfach problem with loving couples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584899)