42 citations · 152 across the 58 of their papers we have counts for
6 papers · 2 filters
Uniquely restricted matchings in subcubic graphs
Maximilian Fürst, Michael A. Henning, Dieter Rautenbach
A matching in a graph is uniquely restricted if no other matching in covers the same set of vertices. We conjecture that every connected subcubic graph with edges a…
On the maximum number of minimum total dominating sets in forests
Michael A. Henning, Elena Mohr, Dieter Rautenbach
We propose the conjecture that every tree with order at least and total domination number has at most $\left(\frac{n-\frac{γ_t}{2}}{\frac{γ_t}{2}}\right)^{\frac{γ_t}{…
Cutting Lemma and Union Lemma for the Domination Game
Paul Dorbec, Michael A. Henning, Sandi Klavžar +1
Two new techniques are introduced into the theory of the domination game. The cutting lemma bounds the game domination number of a partially dominated graph with the game dominatio…
Zero Forcing in Claw-Free Cubic Graphs
Randy Davila, Michael Henning
The zero forcing number of a simple graph, written , is a NP-hard graph invariant which is the result of the zero forcing color change rule. This graph invariant has been hea…
Transversals in Uniform Linear Hypergraphs
Michael A. Henning, Anders Yeo
The transversal number of a hypergraph is the minimum number of vertices that intersect every edge of . A linear hypergraph is one in which every two distinct edges i…
Matching, Path Covers, and Total Forcing Sets
Randy Davila, Michael Henning
A dynamic coloring of the vertices of a graph starts with an initial subset of colored vertices, with all remaining vertices being non-colored. At each discrete time interv…