2 citations · 2 across the 2 of their papers we have counts for
2 papers
math.CO2018★ 2 cited
Some bounds on the uniquely restricted matching number
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…
cs.DM2012
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
Andreas Brandstädt, Arne Leitert, Dieter Rautenbach
Let G=(V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v in V dominates its closed neighborhood N[v]. A vertex set D in G is an efficient domin…