Michael A. Henning

activity

20142023

most citedThoroughly Distributed Colorings

6 citations · 10 across the 13 of their papers we have counts for

collaborators

Showing 2014Show all

5 papers · 1 filter

math.CO2014

Disjunctive Total Domination in Graphs

Michael A. Henning, Viroshan Naicker

Let $G$ be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total dominatio…

math.CO2014

Graphs with Large Disjunctive Total Domination Number

Michael A. Henning, Viroshan Naicker

Let $G$ be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total dominatio…

math.CO2014

Trees with Large Neighborhood Total Domination Number

Michael A. Henning, Kirsti Wash

In this paper, we continue the study of neighborhood total domination in graphs first studied by Arumugam and Sivagnanam [Opuscula Math. 31 (2011), 519--531]. A neighborhood total…

math.CO2014

Induced 2-Regular Subgraphs in k-Chordal Cubic Graphs

Michael A. Henning, Felix Joos, Christian Löwenstein +1

We show that a cubic graph $G$ of order $n$ has an induced $2$ -regular subgraph of order at least a) $\frac{n - 2}{4 - \frac{4}{k}}$ , if $G$ has no induced cycle of length more than $k…

math.CO2014★ 2 cited

Induced Cycles in Graphs

Michael A. Henning, Felix Joos, Christian Löwenstein +1

The maximum cardinality of an induced $2$ -regular subgraph of a graph $G$ is denoted by $c_{ind} (G)$ . We prove that if $G$ is an $r$ -regular graph of order $n$ , then $c_{\rm in…