3 citations · 7 across the 7 of their papers we have counts for
4 papers · 1 filter
A lower bound on the acyclic matching number of subcubic graphs
M. Fürst, D. Rautenbach
The acyclic matching number of a graph is the largest size of an acyclic matching in , that is, a matching in such that the subgraph of induced by the vertices i…
On some hard and some tractable cases of the maximum acyclic matching problem
M. Fürst, D. Rautenbach
Three well-studied types of subgraph-restricted matchings are induced matchings, uniquely restricted matchings, and acyclic matchings. While it is hard to determine the maximum siz…
A Short Proof for a Lower Bound on the Zero Forcing Number
M. Fürst, D. Rautenbach
We provide a short proof of a conjecture of Davila and Kenter concerning a lower bound on the zero forcing number of a graph . More specifically, we show that $Z(G)\geq (…
Equating Maximum Degrees in Graphs without Short Cycles
M. Fürst, M. Gentner, M. A. Henning +2
For an integer at least , and a graph , let be the minimum cardinality of a set of vertices of such that has either vertices of maximum degree…