4 citations · 4 across the 5 of their papers we have counts for
1 paper · 1 filter
Davide Mattiolo, Eckhard Steffen
We construct highly edge-connected r-regular graph which do not contain r−2 pairwise disjoint perfect matchings. The results partially answer a question stated by Thomassen [Fa…