2 citations · 2 across the 2 of their papers we have counts for
1 paper · 1 filter
M. Fürst, D. Rautenbach
A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. We establish tight lower bounds on the maximum size of a uniquely restric…