Maximilian Fürst

activity

20172020

most citedOn some hard and some tractable cases of the maximum acyclic matching problem

3 citations · 7 across the 7 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019

Domination versus edge domination

Julien Baste, Maximilian Fürst, Michael A. Henning +2

We propose the conjecture that the domination number $γ (G)$ of a $Δ$ -regular graph $G$ with $Δ \geq 1$ is always at most its edge domination number $γ_{e} (G)$ , which coincides with th…

math.CO2019

Bounding and approximating minimum maximal matchings in regular graphs

Julien Baste, Maximilian Fürst, Michael A. Henning +2

The edge domination number $γ_{e} (G)$ of a graph $G$ is the minimum size of a maximal matching in $G$ . It is well known that this parameter is computationally very hard, and several…