D. Rautenbach

activity

20092023

most citedHow to determine if a random graph with a fixed degree sequence has a giant component

18 citations · 46 across the 68 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019

Cubic graphs with equal independence number and matching number

Elena Mohr, Dieter Rautenbach

Caro, Davila, and Pepper (arXiv:1909.09093) recently proved $δ (G) α (G) \leq Δ (G) μ (G)$ for every graph $G$ with minimum degree $δ (G)$ , maximum degree $Δ (G)$ , independence number $α(…

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…