Solutions to the Oberwolfach problem for orders up to 100

MaRDI QIDQ6562432zbMATH OpenFDO

Authors Mariusz Meszka

Publication date 26 June 2024

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

zbMATH Keywords

\(k\)-factorable graphsBose's method

Mathematics Subject Classification ID

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

Cites work

• A complete solution to the two-table Oberwolfach problems
• Complete solutions to the Oberwolfach problem for an infinite set of orders
• scientific article; zbMATH DE number 5917757 (Why is no real title available?)
• scientific article; zbMATH DE number 3922695 (Why is no real title available?)
• Merging combinatorial design and optimization: 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 Oberwolfach problem for single-flip 2-factors via graceful labelings
• On the Oberwolfach problem OP(5a, s)
• Resolution of the Oberwolfach problem
• Some observations on the oberwolfach problem
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• The generalised Oberwolfach problem
• The Oberwolfach problem and factors of uniform odd length cycles
• Two-factorisations of complete graphs of orders fifteen and seventeen
• Two-factorizations of the complete graph

Cited in

(4)

• Completing the solution of the directed Oberwolfach problem with two tables
• A solution to small cases of the honeymoon Oberwolfach problem
• The directed Oberwolfach problem with variable cycle lengths: a recursive construction
• Transforming solutions for the Oberwolfach problem into solutions for the spouse-loving variant

This page was built for publication: Solutions to the Oberwolfach problem for orders up to 100

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