3 citations · 7 across the 7 of their papers we have counts for
4 papers · 1 filter
Linear programming based approximation for unweighted induced matchings --- breaking the barrier
Julien Baste, Maximilian Fürst, Dieter Rautenbach
A matching in a graph is induced if no two of its edges are joined by an edge, and finding a large induced matching is a very hard problem. Lin et al. (Approximating weighted induc…
Uniquely restricted matchings in subcubic graphs without short cycles
Maximilian Fürst, Dieter Rautenbach
A matching in a graph is uniquely restricted if no other matching in covers the same set of vertices. We prove that any connected subcubic graph with vertices and g…
On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs
M. Fürst, D. Rautenbach
For a matching in a graph , let be the subgraph of induced by the vertices of that are incident with an edge in . The matching is induced, if is…
Uniquely restricted matchings in subcubic graphs
Maximilian Fürst, Michael A. Henning, Dieter Rautenbach
A matching in a graph is uniquely restricted if no other matching in covers the same set of vertices. We conjecture that every connected subcubic graph with edges a…