Completing the solution of the directed Oberwolfach problem with two tables

DOI10.37236/13315MaRDI QIDQ6841461zbMATH OpenFDO

Authors Daniel Horsley

Publication date 20 March 2026

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/13315

zbMATH Keywords

complete symmetric directed graphdirected 2-factorizationdirected Oberwolfach problem

Mathematics Subject Classification ID

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

Cites work

• A complete solution to the two-table Oberwolfach problems
• A constructive solution to the Oberwolfach problem with a large cycle
• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• A survey on constructive methods for the Oberwolfach problem and its variants
• Complete solutions to the Oberwolfach problem for an infinite set of orders
• Completing the solution of the directed Oberwolfach problem with cycles of equal length
• Hamiltonian decomposition of Cayley graphs of degree 4
• scientific article; zbMATH DE number 5917757 (Why is no real title available?)
• scientific article; zbMATH DE number 2186986 (Why is no real title available?)
• scientific article; zbMATH DE number 3922695 (Why is no real title available?)
• scientific article; zbMATH DE number 2148767 (Why is no real title available?)
• scientific article; zbMATH DE number 3349817 (Why is no real title available?)
• Merging combinatorial design and optimization: the Oberwolfach problem
• On a variation of the Oberwolfach problem
• On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
• On factorisations of complete graphs into circulant graphs and the Oberwolfach problem
• On the directed Oberwolfach problem with equal cycle lengths
• On the directed Oberwolfach Problem with equal cycle lengths: the odd case
• Récréations mathématiques. 2e édition. Tome II.
• Resolution of the Oberwolfach problem
• Resolvable decomposition of K^*_n
• Resolvable Mendelsohn designs with block size 4
• Resolvable perfect Mendelsohn designs with block size five
• Solutions to the Oberwolfach problem for orders up to 100
• Some observations on the oberwolfach problem
• The directed Oberwolfach problem with variable cycle lengths: a recursive construction
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• The Oberwolfach problem and factors of uniform odd length cycles
• Two-factorizations of small complete graphs

This page was built for publication: Completing the solution of the directed Oberwolfach problem with two tables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6841461)