Michael A. Henning

collaborators

2 papers

math.CO2025

A proof of the $\frac{3}{8}$ -conjecture for independent domination in cubic graphs

Boštjan Brešar, Tanja Dravec, Michael A. Henning

A set $S$ of vertices in a graph $G$ is a dominating set of $G$ if every vertex not in $S$ is adjacent to a vertex in~ $S$ . An independent dominating set in $G$ is a dominating set…

math.CO2024

An exploration of the balance game

Paul Dorbec, Michael A. Henning, Zsolt Tuza +1

The balance game is played on a graph $G$ by two players, Admirable (A) and Impish (I), who take turns selecting unlabeled vertices of $G$ . Admirable labels the selected vertices b…

A proof of the 83​-conjecture for independent domination in cubic graphs

An exploration of the balance game

A proof of the $\frac{3}{8}$ -conjecture for independent domination in cubic graphs