On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles

DOI10.1002/jcd.21913zbMath1527.05143arXiv2303.04308OpenAlexW4386051996MaRDI QIDQ6086218

Mateja Šajna, Nevena Francetić

Publication date: 9 November 2023

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

Full work available at URL: https://arxiv.org/abs/2303.04308

zbMATH Keywords

directed Oberwolfach problemresolvable directed cycle decompositioncomplete symmetric equipartite digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complete solution to the two-table Oberwolfach problems
• On the directed Oberwolfach problem with equal cycle lengths
• Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs
• On a variation of the Oberwolfach problem
• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• The solution of the bipartite analogue of the Oberwolfach problem
• Resolvable decomposition of \(K^*_n\)
• Cycle-factorization of symmetric complete multipartite digraphs
• Two-factorizations of small complete graphs
• The Oberwolfach problem and factors of uniform odd length cycles
• The equipartite Oberwolfach problem with uniform tables
• Resolution of the Oberwolfach problem
• Resolvable Mendelsohn designs with block size 4
• On bipartite 2-factorizations of kn − I and the Oberwolfach problem
• Some observations on the oberwolfach problem
• Resolvable Mendelsohn triple systems with equal sized holes
• On the directed Oberwolfach Problem with equal cycle lengths: the odd case
• Merging Combinatorial Design and Optimization: the Oberwolfach Problem

This page was built for publication: On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles