42 citations · 152 across the 58 of their papers we have counts for
14 papers · 2 filters
Every 4-regular 4-uniform hypergraph has a 2-coloring with a free vertex
Michael A Henning, Anders Yeo
In this paper, we continue the study of -colorings in hypergraphs. A hypergraph is -colorable if there is a -coloring of the vertices with no monochromatic hyperedge. It i…
The forcing number of graphs with a given girth
Randy Davila, Michael Henning
In this paper, we study a dynamic coloring of the vertices of a graph that starts with an initial subset of colored vertices, with all remaining vertices being non-colored.…
Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension
Laurent Beaudou, Florent Foucaud, Peter Dankelmann +3
The metric dimension of a graph is the minimum size of a set of vertices such that each vertex is uniquely determined by the distances to the vertices of that set. Our aim is to up…
Thoroughly Distributed Colorings
Wayne Goddard, Michael A. Henning
We consider (not necessarily proper) colorings of the vertices of a graph where every color is thoroughly distributed, that is, appears in every open neighborhood. Equivalently, ev…
Trees with Equal Total Domination and Game Total Domination Numbers
Michael A. Henning, Douglas F. Rall
In this paper, we continue the study of the total domination game in graphs introduced in [Graphs Combin. 31(5) (2015), 1453--1462], where the players Dominator and Staller alterna…
(Total) Domination in Prisms
Jernej Azarija, Michael A. Henning, Sandi Klavžar
With the aid of hypergraph transversals it is proved that , where and denote the total domination number and the domination number of , r…