15 citations · 35 across the 19 of their papers we have counts for
1 paper · 2 filters
Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey +2
Finding a d-regular spanning subgraph (or d-factor) of a graph is easy by Tutte's reduction to the matching problem. By the same reduction, it is easy to find a minimal or maximal…