Extremal values and bounds for the zero forcing number M Gentner, LD Penso, D Rautenbach, US Souza
Discrete applied mathematics 214, 196-200, 2016
74 2016 Some bounds on the zero forcing number of a graph M Gentner, D Rautenbach
Discrete Applied Mathematics 236, 203-213, 2018
67 2018 Smallest domination number and largest independence number of graphs and forests with given degree sequence M Gentner, MA Henning, D Rautenbach
Journal of Graph Theory 88 (1), 131-145, 2018
15 2018 Feedback vertex sets in cubic multigraphs M Gentner, D Rautenbach
Discrete Mathematics 338 (12), 2179-2185, 2015
10 2015 Largest domination number and smallest independence number of forests with given degree sequence M Gentner, MA Henning, D Rautenbach
Discrete Applied Mathematics 206, 181-187, 2016
8 2016 Large values of the clustering coefficient M Gentner, I Heinrich, S Jäger, D Rautenbach
Discrete Mathematics, 2017
6 2017 Dynamic Monopolies for Degree Proportional Thresholds in Connected Graphs of Girth at least Five and Trees M Gentner, D Rautenbach
arXiv preprint arXiv:1601.02099v2, 2016
6 2016 Some comments on the Slater number M Gentner, D Rautenbach
Discrete Mathematics 340 (7), 1497-1502, 2017
5 2017 Equating Maximum Degrees in Graphs without Short Cycles M Fürst, M Gentner, MA Henning, S Jäger, D Rautenbach
arXiv preprint arXiv:1705.07409, 2017
2 2017 Domination and forcing M Gentner
Universität Ulm, 2018
2018 Independence in uniform linear triangle-free hypergraphs P Borowiecki, M Gentner, C Löwenstein, D Rautenbach
Discrete Mathematics 339 (7), 1878-1883, 2016
2016