11 papers
Bounds on the game isolation number and exact values for paths and cycles
Csilla Bujtás, Tanja Dravec, Michael A. Henning +1
The isolation game is played on a graph by two players who take turns playing a vertex such that if is the set of already played vertices, then a vertex can be selected onl…
Independence, induced subgraphs, and domination in -free graphs
Yair Caro, Randy Davila, Michael A. Henning +1
Let be a graph and a family of graphs. Define as the maximum order of any induced subgraph of that belongs to the family .…
A proof of the -conjecture for independent domination in cubic graphs
Boštjan Brešar, Tanja Dravec, Michael A. Henning
A set of vertices in a graph is a dominating set of if every vertex not in is adjacent to a vertex in~. An independent dominating set in is a dominating set…
Identifying codes in graphs of given maximum degree: Characterizing trees
Dipayan Chakraborty, Florent Foucaud, Michael A. Henning +1
An identifying code of a closed-twin-free graph is a dominating set of vertices of such that any two vertices in have a distinct intersection between their closed n…
Spreading in claw-free cubic graphs
Boštjan Brešar, Jaka Hedžet, Michael A. Henning
Let and . We study a dynamic coloring of the vertices of a graph that starts with an initial subset of blue…
On the isolation number of graphs with minimum degree four
Wayne Goddard, Michael A. Henning
An isolating set in a graph is a set of vertices such that removing and its neighborhood leaves no edge. The isolation number of (also known as the vertex-e…