On the Maximum Number of Maximum Independent Sets. - Elena Mohr; Dieter Rautenbach (Graphs Comb., 2018)

On the maximum number of minimum dominating sets in forests. - José D. Alvarado; Simone Dantas; Elena Mohr; Dieter Rautenbach (Discret. Math., 2019)

On the maximum number of minimum total dominating sets in forests. - Michael A. Henning; Elena Mohr; Dieter Rautenbach (Discret. Math. Theor. Comput. Sci., 2019)

Low Weight Perfect Matchings. - Stefan Ehard; Elena Mohr; Dieter Rautenbach (Electron. J. Comb., 2020)

Domination versus edge domination. - Julien Baste; Maximilian Fürst; Michael A. Henning; Elena Mohr; Dieter Rautenbach (Discret. Appl. Math., 2020)

Rainbow triangles and cliques in edge-colored graphs. - Stefan Ehard; Elena Mohr (Eur. J. Comb., 2020)

Bounding and approximating minimum maximal matchings in regular graphs. - Julien Baste; Maximilian Fürst; Michael A. Henning; Elena Mohr; Dieter Rautenbach (Discret. Math., 2021)

Cubic graphs with equal independence number and matching number. - Elena Mohr; Dieter Rautenbach (Discret. Math., 2021)

On the maximum number of maximum independent sets in connected graphs. - Elena Mohr; Dieter Rautenbach (J. Graph Theory, 2021)

On Hamiltonian cycles in claw-free cubic graphs. - Elena Mohr; Dieter Rautenbach (Discuss. Math. Graph Theory, 2022)

Zero-Sum Copies of Spanning Forests in Zero-Sum Complete Graphs. - Elena Mohr; Johannes Pardey; Dieter Rautenbach (Graphs Comb., 2022)

Biholes in balanced bipartite graphs. - Stefan Ehard; Elena Mohr; Dieter Rautenbach (Discuss. Math. Graph Theory, 2023)