8 citations · 22 across the 11 of their papers we have counts for
Showing 2017 · math.COShow all
2 papers · 2 filters
math.CO2017
Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts
Mateja Šajna, Yan D. Steimle
An Euler tour in a hypergraph is a closed walk that traverses each edge of the hypergraph exactly once, while an Euler family, first defined by Bahmanian and Sajna, is a family of…
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_{…