The Oberwolfach problem with loving couples

DOI10.1002/JCD.21946zbMATH Open1542.05024MaRDI QIDQ6584899FDOQ6584899

Authors: Gloria Rinaldi 

Publication date: 8 August 2024

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

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

zbMATH Keywords

2-factorizationOberwolfach problemresolvable cycle decompositions

Mathematics Subject Classification ID

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

Cites Work

• The CRC handbook of combinatorial designs
• On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
• A complete solution to the two-table Oberwolfach problems
• Two-factorizations of small complete graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph products and new solutions to Oberwolfach problems
• 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
• On a variation of the Oberwolfach problem
• The structure of 2-pyramidal 2-factorizations
• On 2-factorizations of the complete graph: From thek-pyramidal to the universal property
• Title not available (Why is that?)
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• The Oberwolfach problem and factors of uniform odd length cycles
• Some cyclic solutions to the three table Oberwolfach problem
• Some new results on 1-rotational 2-factorizations of the complete graph
• On 2-pyramidal Hamiltonian cycle systems
• 2-starters, graceful labelings, and a doubling construction for the Oberwolfach problem
• Some results on 1-rotational Hamiltonian cycle systems
• 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
• \(G\)-invariantly resolvable Steiner 2-designs which are 1-rotational over \(G\)
• Sectionable terraces and the (generalised) Oberwolfach problem
• Explicit constructions for 1-rotational Kirkman triple systems
• On twizzler, zigzag and graceful terraces
• Some observations on the oberwolfach problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Resolution of the Oberwolfach problem
• Regular Oberwolfach problems and group sequencings
• Merging combinatorial design and optimization: the Oberwolfach problem
• On the Oberwolfach problem for single-flip 2-factors via graceful labelings
• On the spouse-loving variant of the Oberwolfach problem
• On the honeymoon Oberwolfach problem
• Solution to the outstanding case of the spouse‐loving variant of the Oberwolfach problem with uniform cycle length

Cited In (2)

• The seating couples problem in the even case
• 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)