5 citations · 6 across the 2 of their papers we have counts for
2 papers
math.CO2017★ 5 cited
On the directed Oberwolfach Problem with equal cycle lengths: the odd case
Andrea Burgess, Nevena Francetic, Mateja Sajna
We show that the complete symmetric digraph admits a resolvable decomposition into directed cycles of length for all odd , . Consequently, $K_{…
math.CO2016★ 1 cited
Eulerian properties of hypergraphs
M. Amin Bahmanian, Mateja Šajna
In this paper we study three substructures in hypergraphs that generalize the notion of an Euler tour in a graph. A flag-traversing tour of a hypergraph corresponds to an Euler tou…