A survey on constructive methods for the Oberwolfach problem and its variants
type: Item
instance of: scholarly article
title: A survey on constructive methods for the Oberwolfach problem and its variants
zbMATH Open document ID: 1548.05266
DOI: 10.1007/978-3-031-48679-1_3
author: Andrea Burgess
author: Peter H. Danziger
author: Tommaso Traetta
publication date: 2024-10-02T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 7921192
zbMATH Keywords: graph factoring
MaRDI profile type: MaRDI publication profile
cites work: Resolvable perfect Mendelsohn designs with block size five
cites work: Q5480706
cites work: On the Hamilton-Waterloo problem
cites work: Q4798525
cites work: Q5294928
cites work: Q3514485
cites work: Some observations on the oberwolfach problem
cites work: The Oberwolfach problem and factors of uniform odd length cycles
cites work: On factorisations of complete graphs into circulant graphs and the Oberwolfach problem
cites work: On the Hamilton-Waterloo problem with triangle factors and \(C_{3x}\)-factors
cites work: Q3794196
cites work: Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment
cites work: Q4359573
cites work: Resolvable Mendelsohn designs with block size 4
cites work: Resolvable decomposition of \(K^*_n\)
cites work: Hamiltonian decomposition of Cayley graphs of degree 4
cites work: Q4718790
cites work: Q4458217
cites work: On the spouse‐loving variant of the Oberwolfach problem
cites work: Octahedral, dicyclic and special linear solutions of some Hamilton-Waterloo problems
cites work: On 2-factorizations of the complete graph: From thek-pyramidal to the universal property
cites work: Hamilton cycle rich two-factorizations of complete graphs
cites work: On bipartite 2-factorizations of kn − I and the Oberwolfach problem
cites work: Complete solutions to the Oberwolfach problem for an infinite set of orders
cites work: On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors
cites work: Cycle decompositions V: Complete graphs into cycles of arbitrary lengths
cites work: Bipartite 2‐Factorizations of Complete Multipartite Graphs
cites work: Decompositions of complete graphs into bipartite 2-regular subgraphs
cites work: Decompositions of complete multigraphs into cycles of varying lengths
cites work: Some constructions for cyclic perfect cycle systems
cites work: On sharply vertex transitive 2-factorizations of the complete graph
cites work: 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
cites work: A non-existence result on cyclic cycle-decompositions of the cocktail party graph
cites work: 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem
cites work: The structure of 2-pyramidal 2-factorizations
cites work: \(G\)-invariantly resolvable Steiner 2-designs which are 1-rotational over \(G\)
cites work: Explicit constructions for 1-rotational Kirkman triple systems
cites work: On the directed Oberwolfach problem with equal cycle lengths
cites work: On the Hamilton–Waterloo Problem with Odd Orders
cites work: On the Hamilton-Waterloo problem with cycle lengths of distinct parities
cites work: On the Hamilton–Waterloo problem with odd cycle lengths
cites work: On the directed Oberwolfach Problem with equal cycle lengths: the odd case
cites work: The Hamilton-Waterloo problem with even cycle lengths
cites work: On the generalized Oberwolfach problem
cites work: On the Oberwolfach problem for single-flip 2-factors via graceful labelings
cites work: On a generalization of the Oberwolfach problem
cites work: Q3411976
cites work: The Hamilton-Waterloo problem for cycle sizes 3 and 4
cites work: Q3012574
cites work: Asymptotic Existence of Resolvable Graph Designs
cites work: A generalization of the Oberwolfach problem
cites work: Two-factorizations of small complete graphs
cites work: Q4660320
cites work: Resolution of the Oberwolfach problem
cites work: Q3698826
cites work: Hamiltonian decompositions of complete graphs
cites work: SOME RESULTS ON THE OBERWOLFACH PROBLEM
cites work: Some problems about \(r\)-factorizations of complete graphs
cites work: The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
cites work: On a variation of the Oberwolfach problem
cites work: The generalised Oberwolfach problem
cites work: On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity
cites work: Q4304386
cites work: The Hamilton-Waterloo problem for triangle-factors and heptagon-factors
cites work: Q4934840
cites work: The equipartite Oberwolfach problem with uniform tables
cites work: A method to construct 1‐rotational factorizations of complete graphs and solutions to the oberwolfach problem

A survey on constructive methods for the Oberwolfach problem and its variants (cites work)
cites work: Uniformly resolvable cycle decompositions with four different factors

A survey on constructive methods for the Oberwolfach problem and its variants (cites work)
cites work: Some cyclic solutions to the three table Oberwolfach problem

A survey on constructive methods for the Oberwolfach problem and its variants (cites work)
cites work: Sectionable terraces and the (generalised) Oberwolfach problem

A survey on constructive methods for the Oberwolfach problem and its variants (cites work)
cites work: From graceful labellings of paths to cyclic solutions of the Oberwolfach problem

A survey on constructive methods for the Oberwolfach problem and its variants (cites work)
cites work: Q3099547

A survey on constructive methods for the Oberwolfach problem and its variants (cites work)
cites work: The solution of the bipartite analogue of the Oberwolfach problem

A survey on constructive methods for the Oberwolfach problem and its variants (cites work)
cites work: Q5661892

A survey on constructive methods for the Oberwolfach problem and its variants (cites work)
cites work: Graph products and new solutions to Oberwolfach problems

A survey on constructive methods for the Oberwolfach problem and its variants (cites work)
cites work: Hamilton decomposable graphs with specified leaves

A survey on constructive methods for the Oberwolfach problem and its variants (cites work)
cites work: Merging Combinatorial Design and Optimization: the Oberwolfach Problem

A survey on constructive methods for the Oberwolfach problem and its variants (cites work)
cites work: The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs.

A survey on constructive methods for the Oberwolfach problem and its variants (cites work)
cites work: A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)

A survey on constructive methods for the Oberwolfach problem and its variants (cites work)
cites work: A complete solution to the two-table Oberwolfach problems

A survey on constructive methods for the Oberwolfach problem and its variants (cites work)
cites work: Solution to the outstanding case of the spouse‐loving variant of the Oberwolfach problem with uniform cycle length

A survey on constructive methods for the Oberwolfach problem and its variants (cites work)
cites work: The Hamilton-Waterloo Problem for C3-Factors and Cn-Factors

A survey on constructive methods for the Oberwolfach problem and its variants (cites work)
cites work: Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem

A survey on constructive methods for the Oberwolfach problem and its variants (cites work)
cites work: Q4774057