On the directed Oberwolfach Problem with equal cycle lengths: the odd case
From MaRDI portal
Publication:4616108
zbMath1404.05165arXiv1706.06625MaRDI QIDQ4616108
Mateja Šajna, Nevena Francetić, Andrea C. Burgess
Publication date: 30 January 2019
Full work available at URL: https://arxiv.org/abs/1706.06625
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items
On the directed Oberwolfach problem with equal cycle lengths, On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles, Completing the solution of the directed Oberwolfach problem with cycles of equal length
Cites Work
- Unnamed Item
- On the directed Oberwolfach problem with equal cycle lengths
- Hamiltonian decomposition of Cayley graphs of degree 4
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
- Resolvable decomposition of \(K^*_n\)
- The Oberwolfach problem and factors of uniform odd length cycles
- Resolvable Mendelsohn designs with block size 4
- Some observations on the oberwolfach problem