The directed Oberwolfach problem with variable cycle lengths: a recursive construction
From MaRDI portal
Cites work
- A complete solution to the two-table Oberwolfach problems
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- Completing the solution of the directed Oberwolfach problem with cycles of equal length
- Hamilton decompositions of certain 6-regular Cayley graphs on abelian groups with a cyclic subgroup of index two
- 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 3922695 (Why is no real title available?)
- scientific article; zbMATH DE number 2148767 (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 the directed Oberwolfach problem with equal cycle lengths
- On the directed Oberwolfach Problem with equal cycle lengths: the odd case
- Resolution of the Oberwolfach problem
- Resolvable decomposition of K^*_n
- Resolvable Mendelsohn designs with block size 4
- Solutions to the Oberwolfach problem for orders up to 100
- Some observations on the oberwolfach problem
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
- The Oberwolfach problem and factors of uniform odd length cycles
- Two-factorisations of complete graphs of orders fifteen and seventeen
- Two-factorizations of small complete graphs
This page was built for publication: The directed Oberwolfach problem with variable cycle lengths: a recursive construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6978952)
