The Oberwolfach problem with loving couples

DOI10.1002/JCD.21946MaRDI QIDQ6584899zbMATH OpenFDO

Authors Gloria Rinaldi

Publication date 8 August 2024

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/JCD.21946

zbMATH Keywords

2-factorizationOberwolfach problemresolvable cycle decompositions

Mathematics Subject Classification ID

Other designs, configurations (05B30) Graph designs and isomorphic decomposition (05C51) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the honeymoon Oberwolfach problem
• Solution to the outstanding case of the spouse‐loving variant of the Oberwolfach problem with uniform cycle length
• Sectionable terraces and the (generalised) Oberwolfach problem
• On \(\lambda\)-fold equipartite Oberwolfach problem with uniform table sizes
• The seating couples problem in the even case

Cites work

• 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
• 2-starters, graceful labelings, and a doubling construction for the Oberwolfach problem
• \(G\)-invariantly resolvable Steiner 2-designs which are 1-rotational over \(G\)
• A complete solution to the two-table Oberwolfach problems
• A non-existence result on cyclic cycle-decompositions of the cocktail party graph
• Explicit constructions for 1-rotational Kirkman triple systems
• From graceful labellings of paths to cyclic solutions of the Oberwolfach problem
• Graph products and new solutions to Oberwolfach problems
• scientific article; zbMATH DE number 5917757 (Why is no real title available?)
• scientific article; zbMATH DE number 4044061 (Why is no real title available?)
• scientific article; zbMATH DE number 4059426 (Why is no real title available?)
• scientific article; zbMATH DE number 637332 (Why is no real title available?)
• scientific article; zbMATH DE number 2148767 (Why is no real title available?)
• scientific article; zbMATH DE number 874528 (Why is no real title available?)
• Merging combinatorial design and optimization: the Oberwolfach problem
• On 2-factorizations of the complete graph: From thek-pyramidal to the universal property
• On 2-pyramidal Hamiltonian cycle systems
• On a variation of the Oberwolfach problem
• On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
• On the honeymoon Oberwolfach problem
• On the Oberwolfach problem for single-flip 2-factors via graceful labelings
• On the spouse-loving variant of the Oberwolfach problem
• On twizzler, zigzag and graceful terraces
• Regular Oberwolfach problems and group sequencings
• Resolution of the Oberwolfach problem
• Sectionable terraces and the (generalised) Oberwolfach problem
• Solution to the outstanding case of the spouse‐loving variant of the Oberwolfach problem with uniform cycle length
• Some cyclic solutions to the three table Oberwolfach problem
• Some new results on 1-rotational 2-factorizations of the complete graph
• Some observations on the oberwolfach problem
• Some results on 1-rotational Hamiltonian cycle systems
• The CRC handbook of combinatorial designs
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• The Oberwolfach problem and factors of uniform odd length cycles
• The structure of 2-pyramidal 2-factorizations
• Two-factorizations of small complete graphs

Cited in

(3)

• Solution to the outstanding case of the spouse‐loving variant of the Oberwolfach problem with uniform cycle length
• The seating couples problem in the even case
• Transforming solutions for the Oberwolfach problem into solutions for the spouse-loving variant

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)