13 citations · 35 across the 16 of their papers we have counts for
1 paper · 1 filter
Andrea Burgess, Nevena Francetic, Mateja Sajna
We show that the complete symmetric digraph K2m∗ admits a resolvable decomposition into directed cycles of length m for all odd m, 5≤m≤49. Consequently, $K_{…