Some nordhaus- gaddum-type results. - Wayne Goddard; Michael A. Henning; Henda C. Swart (J. Graph Theory, 1992)

On the computational complexity of upper distance fractional domination. - Johannes H. Hattingh; Michael A. Henning; Jakobus L. Walters (Australas. J Comb., 1993)

Bounds relating generalized domination parameters. - Michael A. Henning; Henda C. Swart (Discret. Math., 1993)

Principal Common Divisors of Graphs. - Gary Chartrand; Wayne Goddard; Michael A. Henning; Farrokh Saba; Henda C. Swart (Eur. J. Comb., 1993)

On the integrity of distance domination in graphs. - Timothy J. Bean; Michael A. Henning; Henda C. Swart (Australas. J Comb., 1994)

Three-valued k-neighborhood domination in graphs. - Johannes H. Hattingh; Michael A. Henning; Peter J. Slater (Australas. J Comb., 1994)

Extremal results on defective colorings of graphs. - Marietjie Frick; Michael A. Henning (Discret. Math., 1994)

The algorithmic complexity of signed domination in graphs. - Johannes H. Hattingh; Michael A. Henning; Peter J. Slater (Australas. J Comb., 1995)

Distance independence domination in graphs. - Gerd Fricke; Stephen T. Hedetniemi; Michael A. Henning (Ars Comb., 1995)

Majority domination in graphs. - Izak Broere; Johannes H. Hattingh; Michael A. Henning; Alice A. McRae (Discret. Math., 1995)

Irredundance perfect graphs. - Michael A. Henning (Discret. Math., 1995)

Domination in regular graphs. - Michael A. Henning (Ars Comb., 1996)

The Algorithmic Complexity of Minus Domination in Graphs. - Jean E. Dunbar; Wayne Goddard; Stephen T. Hedetniemi; Alice A. McRae; Michael A. Henning (Discret. Appl. Math., 1996)

An Algorithm to Find Two Distance Domination Parameters in a Graph. - Gerd Fricke; Michael A. Henning; Ortrud Oellermann; Henda C. Swart (Discret. Appl. Math., 1996)

Minus domination in regular graphs. - Jean E. Dunbar; Stephen T. Hedetniemi; Michael A. Henning; Alice A. McRae (Discret. Math., 1996)

The diversity of domination. - Michael A. Henning; Ortrud R. Oellermann; Henda C. Swart (Discret. Math., 1996)

Local edge domination critical graphs. - Michael A. Henning; Ortrud R. Oellermann; Henda C. Swart (Discret. Math., 1996)

Inequalities relating domination parameters in cubic graphs. - Michael A. Henning; Peter J. Slater (Discret. Math., 1996)

Edge homogeneous embeddings of cycles in graphs. - Michael A. Henning; Hiren Maharaj (Australas. J Comb., 1997)

Switching Distance Graphs. - John G. Gimbel; Michael A. Henning; Zsolt Tuza (Ars Comb., 1997)

Opinion functions on trees. - Lowell W. Beineke; Michael A. Henning (Discret. Math., 1997)

A note on cliques and independent sets. - Roger C. Entringer; Wayne Goddard; Michael A. Henning (J. Graph Theory, 1997)

Domination critical graphs with respect to relative complements. - Teresa W. Haynes; Michael A. Henning (Australas. J Comb., 1998)

Closed neighborhood order dominating functions. - Michael A. Henning; Peter J. Slater (Australas. J Comb., 1998)

Distance irredundance in graphs: complexity issues. - Johannes H. Hattingh; Michael A. Henning; Jacobus L. Walters (Ars Comb., 1998)

Partial signed domination in graphs. - Johannes H. Hattingh; Elna Ungerer; Michael A. Henning (Ars Comb., 1998)

Some General Aspects of the Framing Number of a Digraph. - Michael A. Henning; Hiren Maharaj (Discret. Appl. Math., 1998)

Star-path bipartite Ramsey numbers, . - Johannes H. Hattingh; Michael A. Henning (Discret. Math., 1998)

Packing in trees. - Michael A. Henning (Discret. Math., 1998)

Strict majority functions on graphs. - Michael A. Henning; Hugh R. Hind (J. Graph Theory, 1998)

On the principal edge bipartition of a graph. - Michael A. Henning; C. H. C. Little (Australas. J Comb., 1999)

Queens graphs. - Lowell W. Beineke; Izak Broere; Michael A. Henning (Discret. Math., 1999)

Minus domination in graphs. - Jean E. Dunbar; Stephen T. Hedetniemi; Michael A. Henning; Alice A. McRae (Discret. Math., 1999)

On perfect neighborhood sets in graphs. - Gerd Fricke; Teresa W. Haynes; Sandra Mitchell Hedetniemi; Stephen T. Hedetniemi; Michael A. Henning (Discret. Math., 1999)

Real and integer domination in graphs. - Wayne Goddard; Michael A. Henning (Discret. Math., 1999)

Graphs with large restrained domination number. - Michael A. Henning (Discret. Math., 1999)

Homogeneous Embeddings of Cycles in Graphs. - Wayne Goddard; Michael A. Henning; Hiren Maharaj (Graphs Comb., 1999)

Generalized eccentricity, radius, and diameter in graphs. - Peter Dankelmann; Wayne Goddard; Michael A. Henning; Henda C. Swart (Networks, 1999)

A characterization of domination 4-relative-critical graphs of diameter 5. - Teresa W. Haynes; Michael A. Henning (Australas. J Comb., 2000)

The domatic numbers of factors of graphs. - Teresa W. Haynes; Michael A. Henning (Ars Comb., 2000)

Restrained domination in trees. - Gayla S. Domke; Johannes H. Hattingh; Michael A. Henning; Lisa R. Markus (Discret. Math., 2000)

Bipartite Ramsey numbers and Zarankiewicz numbers. - Wayne Goddard; Michael A. Henning; Ortrud R. Oellermann (Discret. Math., 2000)

Graphs with least domination number three-fifths their order. - Michael A. Henning (Discret. Math., 2000)

Total domination in graphs with minimum degree three. - Odile Favaron; Michael A. Henning; Christina M. Mynhardt; Joël Puech (J. Graph Theory, 2000)

Characterizations of trees with equal domination parameters. - Johannes H. Hattingh; Michael A. Henning (J. Graph Theory, 2000)

Graphs with large total domination number. - Michael A. Henning (J. Graph Theory, 2000)

On cliques and bicliques. - Michael A. Henning (J. Graph Theory, 2000)

The average connectivity of regular multipartite tournaments. - Michael A. Henning; Ortrud R. Oellermann (Australas. J Comb., 2001)

Multipartite Ramsey Numbers. - David P. Day; Wayne Goddard; Michael A. Henning; Henda C. Swart (Ars Comb., 2001)

Stable and unstable graphs with total irredundance number zero. - Teresa W. Haynes; Stephen T. Hedetniemi; Michael A. Henning; Debra J. Knisley (Ars Comb., 2001)

Domination and total domination critical trees with respect to relative complements. - Teresa W. Haynes; Michael A. Henning; Lucas C. van der Merwe (Ars Comb., 2001)

On domination and annihilation in graphs with claw-free blocks. - Odile Favaron; Michael A. Henning; Joël Puech; Dieter Rautenbach (Discret. Math., 2001)

Pancyclicity of the prism. - Wayne Goddard; Michael A. Henning (Discret. Math., 2001)

Total domination good vertices in graphs. - Teresa W. Haynes; Michael A. Henning (Australas. J Comb., 2002)

Total domination critical graphs with respect to relative complements. - Teresa W. Haynes; Michael A. Henning; Lucas C. van der Merwe (Ars Comb., 2002)

Total irredundance in graphs. - Odile Favaron; Teresa W. Haynes; Stephen T. Hedetniemi; Michael A. Henning; Debra J. Knisley (Discret. Math., 2002)

A characterization of i-excellent trees. - Teresa W. Haynes; Michael A. Henning (Discret. Math., 2002)

Trees with equal domination and tree-free domination numbers. - Teresa W. Haynes; Michael A. Henning (Discret. Math., 2002)

Total domination supercritical graphs with respect to relative complements. - Teresa W. Haynes; Michael A. Henning; Lucas C. van der Merwe (Discret. Math., 2002)

Restricted domination in graphs. - Michael A. Henning (Discret. Math., 2002)

Signed 2-independence in graphs. - Michael A. Henning (Discret. Math., 2002)

The upper domination Ramsey number u(3, 3, 3). - Michael A. Henning; Ortrud Oellermann (Discret. Math., 2002)

Trees with unique minimum total dominating sets. - Teresa W. Haynes; Michael A. Henning (Discuss. Math. Graph Theory, 2002)

A characterization of Roman trees. - Michael A. Henning (Discuss. Math. Graph Theory, 2002)

Vertex Coverings by Coloured Induced Graphs - Frames and Umbrellas. - Wayne Goddard; Michael A. Henning (Electron. Notes Discret. Math., 2002)

Domination in planar graphs with small diameter. - Wayne Goddard; Michael A. Henning (J. Graph Theory, 2002)

Domination in Graphs Applied to Electric Power Networks. - Teresa W. Haynes; Sandra Mitchell Hedetniemi; Stephen T. Hedetniemi; Michael A. Henning (SIAM J. Discret. Math., 2002)

Graphical Measurement. - Gary Chartrand; Ping Zhang 004; Teresa W. Haynes; Michael A. Henning; Fred R. McMorris; Robert C. Brigham (Handbook of Graph Theory, 2003)

Average lower independence in trees and outerplanar graphs. - Sheng Bau; Michael A. Henning; Peter Dankelmann (Ars Comb., 2003)

Global Defensive Alliances in Graphs. - Teresa W. Haynes; Stephen T. Hedetniemi; Michael A. Henning (Electron. J. Comb., 2003)

Matching transformation graphs of cubic bipartite plane graphs. - Sheng Bau; Michael A. Henning (Discret. Math., 2003)

Graphs of order n with locating-chromatic number n-1. - Gary Chartrand; David Erwin; Michael A. Henning; Peter J. Slater; Ping Zhang 004 (Discret. Math., 2003)

Stratification and domination in graphs. - Gary Chartrand; Teresa W. Haynes; Michael A. Henning; Ping Zhang 004 (Discret. Math., 2003)

Vertices contained in all or in no minimum total dominating set of a tree. - Ernest J. Cockayne; Michael A. Henning; Christina M. Mynhardt (Discret. Math., 2003)

Nordhaus-Gaddum bounds for independent domination. - Wayne Goddard; Michael A. Henning (Discret. Math., 2003)

Changing and unchanging domination: a classification. - Teresa W. Haynes; Michael A. Henning (Discret. Math., 2003)

H-forming sets in graphs. - Teresa W. Haynes; Stephen T. Hedetniemi; Michael A. Henning; Peter J. Slater (Discret. Math., 2003)

Strong equality of domination parameters in trees. - Teresa W. Haynes; Michael A. Henning; Peter J. Slater (Discret. Math., 2003)

Defending the Roman Empire from multiple attacks. - Michael A. Henning (Discret. Math., 2003)

Total domination excellent trees. - Michael A. Henning (Discret. Math., 2003)

Defending the Roman Empire–A new strategy. - Michael A. Henning; Stephen T. Hedetniemi (Discret. Math., 2003)

Upper total domination in claw-free graphs. - Odile Favaron; Michael A. Henning (J. Graph Theory, 2003)

A characterization of trees with equal total domination and paired-domination numbers. - Erfang Shan; Liying Kang; Michael A. Henning (Australas. J Comb., 2004)

Detour Domination in Graphs. - Gary Chartrand; Teresa W. Haynes; Michael A. Henning; Ping Zhang 004 (Ars Comb., 2004)

Trees with equal average domination and independent domination numbers. - Michael A. Henning (Ars Comb., 2004)

Metric-Locating-Dominating Sets in Graphs. - Michael A. Henning; Ortrud Oellermann (Ars Comb., 2004)

The average connectivity of a digraph. - Michael A. Henning; Ortrud Oellermann (Discret. Appl. Math., 2004)

The diameter of total domination vertex critical graphs. - Wayne Goddard; Teresa W. Haynes; Michael A. Henning; Lucas C. van der Merwe (Discret. Math., 2004)

Total domination subdivision numbers of trees. - Teresa W. Haynes; Michael A. Henning; Lora Hopkins (Discret. Math., 2004)

Restricted total domination in graphs. - Michael A. Henning (Discret. Math., 2004)

Signed total domination in graphs. - Michael A. Henning (Discret. Math., 2004)

Stratification and domination in graphs II. - Michael A. Henning; Jacob Elgin Maritz (Discret. Math., 2004)

On upper domination Ramsey numbers for graphs. - Michael A. Henning; Ortrud Oellermann (Discret. Math., 2004)

Total domination subdivision numbers of graphs. - Teresa W. Haynes; Michael A. Henning; Lora Hopkins (Discuss. Math. Graph Theory, 2004)

Paired-Domination in Claw-Free Cubic Graphs. - Odile Favaron; Michael A. Henning (Graphs Comb., 2004)

Trees with Equal Domination and Paired-domination Numbers. - Teresa W. Haynes; Michael A. Henning; Peter J. Slater (Ars Comb., 2005)

Bicritical domination. - Robert C. Brigham; Teresa W. Haynes; Michael A. Henning; Douglas F. Rall (Discret. Math., 2005)

Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets. - Michael Dorfling; Wayne Goddard; Johannes H. Hattingh; Michael A. Henning (Discret. Math., 2005)

Trees with two disjoint minimum independent dominating sets. - Teresa W. Haynes; Michael A. Henning (Discret. Math., 2005)

Stratification and domination in graphs with minimum degree two. - Michael A. Henning; Jacob Elgin Maritz (Discret. Math., 2005)

On Double Domination in Graphs. - Jochen Harant; Michael A. Henning (Discuss. Math. Graph Theory, 2005)

Graphs with double domination numbers. - Michael A. Henning (Discuss. Math. Graph Theory, 2005)

Paired-domination of Cartesian products of graphs and rainbow domination. - Bostjan Bresar; Michael A. Henning; Douglas F. Rall (Electron. Notes Discret. Math., 2005)

On the Total Domination Number of Cartesian Products of Graphs. - Michael A. Henning; Douglas F. Rall (Graphs Comb., 2005)

Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree. - Michael A. Henning; Michael D. Plummer (J. Comb. Optim., 2005)

Multiple vertex coverings by cliques. - Wayne Goddard; Michael A. Henning (J. Graph Theory, 2005)

A linear Vizing-like relation relating the size and total domination number of a graph. - Michael A. Henning (J. Graph Theory, 2005)

Total k-subdominating functions on graphs. - Laura M. Harris; Johannes H. Hattingh; Michael A. Henning (Australas. J Comb., 2006)

Algorithmic aspects of minus total k-subdomination in graphs. - Laura M. Harris; Johannes H. Hattingh; Michael A. Henning (Australas. J Comb., 2006)

Placing monitoring devices in electric power networks modelled by block graphs. - David Atkins; Teresa W. Haynes; Michael A. Henning (Ars Comb., 2006)

Domination in Planar Graphs with Small Diameter II. - Michael Dorfling; Wayne Goddard; Michael A. Henning (Ars Comb., 2006)

Private Domination Trees. - Teresa W. Haynes; Michael A. Henning (Ars Comb., 2006)

On the signed total chromatic number of a graph. - Michael A. Henning (Ars Comb., 2006)

Stratification and Domination in Prisms. - Michael A. Henning; Jacob Elgin Maritz (Ars Comb., 2006)

Total Domination and Matching Numbers in Claw-Free Graphs. - Michael A. Henning; Anders Yeo (Electron. J. Comb., 2006)

A note on power domination in grid graphs. - Michael Dorfling; Michael A. Henning (Discret. Appl. Math., 2006)

Locating and total dominating sets in trees. - Teresa W. Haynes; Michael A. Henning; Jamie Howard (Discret. Appl. Math., 2006)

Simultaneous graph parameters: Factor domination and factor total domination. - Peter Dankelmann; Michael A. Henning; Wayne Goddard; Renu C. Laskar (Discret. Math., 2006)

Construction of trees and graphs with equal domination parameters. - Michael Dorfling; Wayne Goddard; Michael A. Henning; Christina M. Mynhardt (Discret. Math., 2006)

Algorithmic aspects of total k-subdomination in graphs. - Laura M. Harris; Johannes H. Hattingh; Michael A. Henning (Discuss. Math. Graph Theory, 2006)

Trees with Equal Domination and Restrained Domination Numbers. - Peter Dankelmann; Johannes H. Hattingh; Michael A. Henning; Henda C. Swart (J. Glob. Optim., 2006)

A New Upper Bound on the Total Domination Number of a Graph. - Michael A. Henning; Anders Yeo (Electron. J. Comb., 2007)

On equality in an upper bound for the restrained and total domination numbers of a graph. - Peter Dankelmann; David P. Day; Johannes H. Hattingh; Michael A. Henning; Lisa R. Markus; Henda C. Swart (Discret. Math., 2007)

Restricted domination in graphs with minimum degree 2. - Michael A. Henning (Discret. Math., 2007)

On the irregularity of bipartite graphs. - Michael A. Henning; Dieter Rautenbach (Discret. Math., 2007)

Domination in partitioned graphs with minimum degree two. - Michael A. Henning; Preben D. Vestergaard (Discret. Math., 2007)

Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph. - Michael A. Henning; Anders Yeo (Graphs Comb., 2007)

Paired-domination in generalized claw-free graphs. - Paul Dorbec; Sylvain Gravier; Michael A. Henning (J. Comb. Optim., 2007)

Restricted domination parameters in graphs. - Wayne Goddard; Michael A. Henning (J. Comb. Optim., 2007)

Graphs with large paired-domination number. - Michael A. Henning (J. Comb. Optim., 2007)

Erratum to: "A linear vizing-like relation relating the size and total domination number of a graph". - Erfang Shan; Liying Kang; Michael A. Henning (J. Graph Theory, 2007)

Diameter of paired domination edge-critical graphs. - Michelle Edwards; Richard G. Gibson; Michael A. Henning; Christina M. Mynhardt (Australas. J Comb., 2008)

Restrained Domination Excellent Trees. - Johannes H. Hattingh; Michael A. Henning (Ars Comb., 2008)

A note on graphs with disjoint dominating and total dominating sets. - Michael A. Henning; Justin Southey (Ars Comb., 2008)

Total domination in claw-free graphs with minimum degree 2. - Odile Favaron; Michael A. Henning (Discret. Math., 2008)

Bounds on total domination in claw-free cubic graphs. - Odile Favaron; Michael A. Henning (Discret. Math., 2008)

The independence number in graphs of maximum degree three. - Jochen Harant; Michael A. Henning; Dieter Rautenbach; Ingo Schiermeyer (Discret. Math., 2008)

On matching and total domination in graphs. - Michael A. Henning; Liying Kang; Erfang Shan; Anders Yeo (Discret. Math., 2008)

Total restrained domination in graphs with minimum degree two. - Michael A. Henning; Jacob Elgin Maritz (Discret. Math., 2008)

Total Domination in Graphs with Given Girth. - Michael A. Henning; Anders Yeo (Graphs Comb., 2008)

On the upper total domination number of Cartesian products of graphs. - Paul Dorbec; Michael A. Henning; Douglas F. Rall (J. Comb. Optim., 2008)

Total domination in partitioned trees and partitioned graphs with minimum degree two. - Allan Frendrup; Michael A. Henning; Preben D. Vestergaard (J. Glob. Optim., 2008)

Hypergraphs with large transversal number and with edge sizes at least 3. - Michael A. Henning; Anders Yeo (J. Graph Theory, 2008)

Upper Bounds on the Total Domination Number. - Teresa W. Haynes; Michael A. Henning (Ars Comb., 2009)

Restricted total domination in graphs with minimum degree two. - Michael A. Henning (Ars Comb., 2009)

Bounds relating the weakly connected domination number to the total domination number and the matching number. - Johannes H. Hattingh; Michael A. Henning (Discret. Appl. Math., 2009)

Domination, radius, and minimum degree. - Michael A. Henning; Simon Mukwembi (Discret. Appl. Math., 2009)

On total domination vertex critical graphs of high connectivity. - Michael A. Henning; Nader Jafari Rad (Discret. Appl. Math., 2009)

Locating and paired-dominating sets in graphs. - John McCoy; Michael A. Henning (Discret. Appl. Math., 2009)

On the ratios between packing and domination parameters of a graph. - Alewyn P. Burger; Michael A. Henning; Jan H. van Vuuren (Discret. Math., 2009)

An upper bound on the domination number of a graph with minimum degree 2. - Allan Frendrup; Michael A. Henning; Bert Randerath; Preben D. Vestergaard (Discret. Math., 2009)

A dedication to Professor Gary Chartrand. - Teresa W. Haynes; Michael A. Henning; Ping Zhang 004 (Discret. Math., 2009)

A survey of stratified domination in graphs. - Teresa W. Haynes; Michael A. Henning; Ping Zhang 004 (Discret. Math., 2009)

A survey of selected recent results on total domination in graphs. - Michael A. Henning (Discret. Math., 2009)

Remarks about disjoint dominating sets. - Michael A. Henning; Christian Löwenstein; Dieter Rautenbach (Discret. Math., 2009)

Total domination in planar graphs of diameter two. - Michael A. Henning; John McCoy (Discret. Math., 2009)

Local Steiner convexity. - Michael A. Henning; Morten Hegner Nielsen; Ortrud R. Oellermann (Eur. J. Comb., 2009)

A Characterization of Cubic Graphs with Paired-Domination Number Three-Fifths Their Order. - Wayne Goddard; Michael A. Henning (Graphs Comb., 2009)

Domination and total domination in complementary prisms. - Teresa W. Haynes; Michael A. Henning; Lucas C. van der Merwe (J. Comb. Optim., 2009)

Total domination in 2-connected graphs and in graphs with no induced 6-cycles. - Michael A. Henning; Anders Yeo (J. Graph Theory, 2009)

An independent dominating set in the complement of a minimum dominating set of a tree. - Michael A. Henning; Christian Löwenstein; Dieter Rautenbach (Appl. Math. Lett., 2010)

Total domination critical and stable graphs upon edge removal. - Wyatt J. Desormeaux; Teresa W. Haynes; Michael A. Henning (Discret. Appl. Math., 2010)

k-tuple total domination in graphs. - Michael A. Henning; Adel P. Kazemi (Discret. Appl. Math., 2010)

Disjoint dominating and total dominating sets in graphs. - Michael A. Henning; Christian Löwenstein; Dieter Rautenbach; Justin Southey (Discret. Appl. Math., 2010)

Properties of total domination edge-critical graphs. - Michael A. Henning; Lucas C. van der Merwe (Discret. Appl. Math., 2010)

Total domination stable graphs upon edge addition. - Wyatt J. Desormeaux; Teresa W. Haynes; Michael A. Henning (Discret. Math., 2010)

Erratum to: "Local edge domination critical graphs" [Discrete Mathematics 161 (1996) 175-184]. - Michael A. Henning (Discret. Math., 2010)

An upper bound on the paired-domination number in terms of the number of edges in the graph. - Michael A. Henning (Discret. Math., 2010)

On a conjecture on total domination in claw-free cubic graphs. - Justin Southey; Michael A. Henning (Discret. Math., 2010)

Partitioning a graph into a dominating set, a total dominating set, and something else. - Michael A. Henning; Christian Löwenstein; Dieter Rautenbach (Discuss. Math. Graph Theory, 2010)

A short proof of a result on a Vizing-like problem for integer total domination. - Michael A. Henning (J. Comb. Optim., 2010)

Strong Transversals in Hypergraphs and Double Total Domination in Graphs. - Michael A. Henning; Anders Yeo (SIAM J. Discret. Math., 2010)

Bounds on the k-domination number of a graph. - Ermelinda DeLaViña; Wayne Goddard; Michael A. Henning; Ryan Pepper; Emil R. Vaughan (Appl. Math. Lett., 2011)

Nordhaus-Gaddum bounds for total domination. - Michael A. Henning; Ernst J. Joubert; Justin Southey (Appl. Math. Lett., 2011)

Hamiltonicity of k-Traceable Graphs. - Frank Bullock; Peter Dankelmann; Marietjie Frick; Michael A. Henning; Ortrud R. Oellermann; Susan A. van Aardt (Electron. J. Comb., 2011)

A New Bound on the Domination Number of Graphs with Minimum Degree Two. - Michael A. Henning; Ingo Schiermeyer; Anders Yeo (Electron. J. Comb., 2011)

An extremal problem for total domination stable graphs upon edge removal. - Wyatt J. Desormeaux; Teresa W. Haynes; Michael A. Henning (Discret. Appl. Math., 2011)

Total domination changing and stable graphs upon vertex removal. - Wyatt J. Desormeaux; Teresa W. Haynes; Michael A. Henning (Discret. Appl. Math., 2011)

Total domination dot-critical graphs. - Michael A. Henning; Nader Jafari Rad (Discret. Appl. Math., 2011)

A note on total reinforcement in graphs. - Michael A. Henning; Nader Jafari Rad; Joanna Raczek (Discret. Appl. Math., 2011)

A Greedy Partition Lemma for directed domination. - Yair Caro; Michael A. Henning (Discret. Optim., 2011)

A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free. - Teresa W. Haynes; Michael A. Henning; Anders Yeo (Discret. Optim., 2011)

Maximal independent sets in minimum colorings. - S. Arumugam 001; Teresa W. Haynes; Michael A. Henning; Yared Nigussie (Discret. Math., 2011)

On the existence of k-partite or Kp-free total domination edge-critical graphs. - Teresa W. Haynes; Michael A. Henning; Lucas C. van der Merwe; Anders Yeo (Discret. Math., 2011)

On a conjecture of Murty and Simon on diameter 2-critical graphs. - Teresa W. Haynes; Michael A. Henning; Lucas C. van der Merwe; Anders Yeo (Discret. Math., 2011)

Dominating sets, packings, and the maximum degree. - Michael A. Henning; Christian Löwenstein; Dieter Rautenbach (Discret. Math., 2011)

Nordhaus-Gaddum Type Results for Total Domination. - Michael A. Henning; Ernst J. Joubert; Justin Southey (Discret. Math. Theor. Comput. Sci., 2011)

Perfect Matchings in Total Domination Critical Graphs. - Michael A. Henning; Anders Yeo (Graphs Comb., 2011)

Upper paired-domination in claw-free graphs. - Paul Dorbec; Michael A. Henning (J. Comb. Optim., 2011)

Which trees have a differentiating-paired dominating set? - Michael A. Henning; John McCoy (J. Comb. Optim., 2011)

A characterization of graphs with disjoint dominating and paired-dominating sets. - Justin Southey; Michael A. Henning (J. Comb. Optim., 2011)

Identifying Vertex Covers in Graphs. - Michael A. Henning; Anders Yeo (Electron. J. Comb., 2012)

Directed domination in oriented graphs. - Yair Caro; Michael A. Henning (Discret. Appl. Math., 2012)

A characterization of diameter-2-critical graphs whose complements are diamond-free. - Teresa W. Haynes; Michael A. Henning (Discret. Appl. Math., 2012)

Multiple factor Nordhaus-Gaddum type results for domination and total domination. - Michael A. Henning; Ernst J. Joubert; Justin Southey (Discret. Appl. Math., 2012)

Total domination in inflated graphs. - Michael A. Henning; Adel P. Kazemi (Discret. Appl. Math., 2012)

Hypergraphs with large domination number and with edge sizes at least three. - Michael A. Henning; Christian Löwenstein (Discret. Appl. Math., 2012)

On α-total domination in graphs. - Michael A. Henning; Nader Jafari Rad (Discret. Appl. Math., 2012)

Locating-total domination in graphs. - Michael A. Henning; Nader Jafari Rad (Discret. Appl. Math., 2012)

Erratum to "Total domination supercritical graphs with respect to relative complements" [Discrete Math. 258 (2002) 361-371]. - Abdollah Alimadadi; Changiz Eslahchi; Teresa W. Haynes; Michael A. Henning; Nader Jafari Rad; Lucas C. van der Merwe (Discret. Math., 2012)

Fair domination in graphs. - Yair Caro; Adriana Hansberg; Michael A. Henning (Discret. Math., 2012)

On a conjecture of Murty and Simon on diameter two critical graphs II. - Teresa W. Haynes; Michael A. Henning; Anders Yeo (Discret. Math., 2012)

Locating-total domination in claw-free cubic graphs. - Michael A. Henning; Christian Löwenstein (Discret. Math., 2012)

Independent sets and matchings in subcubic graphs. - Michael A. Henning; Christian Löwenstein; Dieter Rautenbach (Discret. Math., 2012)

The maximum diameter of total domination edge-critical graphs. - Michael A. Henning; Lucas C. van der Merwe (Discret. Math., 2012)

Transversals and domination in uniform hypergraphs. - Csilla Bujtás; Michael A. Henning; Zsolt Tuza (Eur. J. Comb., 2012)

Girth and Total Domination in Graphs. - Michael A. Henning; Anders Yeo (Graphs Comb., 2012)

An Improved Upper Bound on the Total Restrained Domination Number in Cubic Graphs. - Justin Southey; Michael A. Henning (Graphs Comb., 2012)

k-tuple total domination in cross products of graphs. - Michael A. Henning; Adel P. Kazemi (J. Comb. Optim., 2012)

Vizing's conjecture: a survey and recent results. - Bostjan Bresar; Paul Dorbec; Wayne Goddard; Bert L. Hartnell; Michael A. Henning; Sandi Klavzar; Douglas F. Rall (J. Graph Theory, 2012)

Vertex Disjoint Cycles of Different Length in Digraphs. - Michael A. Henning; Anders Yeo (SIAM J. Discret. Math., 2012)

Relating the annihilation number and the total domination number of a tree. - Wyatt J. Desormeaux; Teresa W. Haynes; Michael A. Henning (Discret. Appl. Math., 2013)

Bounds on the connected domination number of a graph. - Wyatt J. Desormeaux; Teresa W. Haynes; Michael A. Henning (Discret. Appl. Math., 2013)

Equality in a linear Vizing-like relation that relates the size and total domination number of a graph. - Michael A. Henning; Ernst J. Joubert (Discret. Appl. Math., 2013)

Bounds on neighborhood total domination in graphs. - Michael A. Henning; Nader Jafari Rad (Discret. Appl. Math., 2013)

Independent domination in graphs: A survey and recent results. - Wayne Goddard; Michael A. Henning (Discret. Math., 2013)

Open packing, total domination, and the P3-Radon number. - Michael A. Henning; Dieter Rautenbach; Philipp Matthias Schäfer (Discret. Math., 2013)

Total domination and matching numbers in graphs with all vertices in triangles. - Michael A. Henning; Anders Yeo (Discret. Math., 2013)

Hypergraphs with large transversal number. - Michael A. Henning; Anders Yeo (Discret. Math., 2013)

Domination versus independent domination in cubic graphs. - Justin Southey; Michael A. Henning (Discret. Math., 2013)

On graphs with disjoint dominating and 2-dominating sets. - Michael A. Henning; Douglas F. Rall (Discuss. Math. Graph Theory, 2013)

Transversals and matchings in 3-uniform hypergraphs. - Michael A. Henning; Anders Yeo (Eur. J. Comb., 2013)

22-colorings in kk-regular kk-uniform hypergraphs. - Michael A. Henning; Anders Yeo (Eur. J. Comb., 2013)

Edge lifting and total domination in graphs. - Wyatt J. Desormeaux; Teresa W. Haynes; Michael A. Henning (J. Comb. Optim., 2013)

Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three. - Michael A. Henning; Anders Yeo (J. Graph Theory, 2013)

Edge Weighting Functions on Dominating Sets. - Justin Southey; Michael A. Henning (J. Graph Theory, 2013)

Generalized Power Domination in Regular Graphs. - Paul Dorbec; Michael A. Henning; Christian Löwenstein; Mickaël Montassier; André Raspaud (SIAM J. Discret. Math., 2013)

Total Transversals and Total Domination in Uniform Hypergraphs. - Csilla Bujtás; Michael A. Henning; Zsolt Tuza; Anders Yeo (Electron. J. Comb., 2014)

A New Lower Bound on the Independence Number of a Graph and Applications. - Michael A. Henning; Christian Löwenstein; Justin Southey; Anders Yeo (Electron. J. Comb., 2014)

Improved bounds on the domination number of a tree. - Wyatt J. Desormeaux; Teresa W. Haynes; Michael A. Henning (Discret. Appl. Math., 2014)

A characterization of P5-free, diameter-2-critical graphs. - Teresa W. Haynes; Michael A. Henning (Discret. Appl. Math., 2014)

An improved lower bound on the independence number of a graph. - Michael A. Henning; Christian Löwenstein (Discret. Appl. Math., 2014)

Independent domination in subcubic bipartite graphs of girth at least six. - Michael A. Henning; Christian Löwenstein; Dieter Rautenbach (Discret. Appl. Math., 2014)

Graphs with maximum size and given paired-domination number. - Michael A. Henning; John McCoy; Justin Southey (Discret. Appl. Math., 2014)

A new lower bound for the total domination number in graphs proving a Graffiti.pc Conjecture. - Michael A. Henning; Anders Yeo (Discret. Appl. Math., 2014)

Relating the annihilation number and the 2-domination number of a tree. - Wyatt J. Desormeaux; Michael A. Henning; Douglas F. Rall; Anders Yeo (Discret. Math., 2014)

A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid Theorem. - Michael A. Henning; Christian Löwenstein (Discret. Math., 2014)

On matching and semitotal domination in graphs. - Michael A. Henning; Alister J. Marcon (Discret. Math., 2014)

Induced matchings in subcubic graphs without short cycles. - Michael A. Henning; Dieter Rautenbach (Discret. Math., 2014)

Linear hypergraphs with large transversal number and maximum degree two. - Michael Dorfling; Michael A. Henning (Eur. J. Comb., 2014)

Simultaneous Domination in Graphs. - Yair Caro; Michael A. Henning (Graphs Comb., 2014)

Distinguishing-Transversal in Hypergraphs and Identifying Open Codes in Cubic Graphs. - Michael A. Henning; Anders Yeo (Graphs Comb., 2014)

Signed Roman domination in graphs. - Hossein Abdollahzadeh Ahangar; Michael A. Henning; Christian Löwenstein; Yancai Zhao; Vladimir Samodivkin (J. Comb. Optim., 2014)

Paired versus double domination in K 1, r -free graphs. - Paul Dorbec; Bert L. Hartnell; Michael A. Henning (J. Comb. Optim., 2014)

Total Domination in Graphs with Diameter 2. - Wyatt J. Desormeaux; Teresa W. Haynes; Michael A. Henning; Anders Yeo (J. Graph Theory, 2014)

Domination versus disjunctive domination in trees. - Michael A. Henning; Sinclair A. Marcon (Discret. Appl. Math., 2015)

A characterization of the non-trivial diameter two graphs of minimum size. - Michael A. Henning; Justin Southey (Discret. Appl. Math., 2015)

Signed Roman k-domination in trees. - Michael A. Henning; Lutz Volkmann (Discret. Appl. Math., 2015)

Trees with large neighborhood total domination number. - Michael A. Henning; Kirsti Wash (Discret. Appl. Math., 2015)

Graphs with Large Disjunctive Total Domination Number. - Michael Anthony Henning; Viroshan Naicker (Discret. Math. Theor. Comput. Sci., 2015)

Total Domination Edge Critical Graphs with Total Domination Number Three and Many Dominating Pairs. - Camino Balbuena; Adriana Hansberg; Teresa W. Haynes; Michael A. Henning (Graphs Comb., 2015)

Total Dominator Colorings and Total Domination in Graphs. - Michael A. Henning (Graphs Comb., 2015)

Total Version of the Domination Game. - Michael A. Henning; Sandi Klavzar; Douglas F. Rall (Graphs Comb., 2015)

Progress on the Murty-Simon Conjecture on diameter-2 critical graphs: a survey. - Teresa W. Haynes; Michael A. Henning; Lucas C. van der Merwe; Anders Yeo (J. Comb. Optim., 2015)

Independent Domination in Cubic Graphs. - Paul Dorbec; Michael A. Henning; Mickaël Montassier; Justin Southey (J. Graph Theory, 2015)

On 2-Colorings of Hypergraphs. - Michael A. Henning; Anders Yeo (J. Graph Theory, 2015)

Total Transversals in Hypergraphs and Their Applications. - Michael A. Henning; Anders Yeo (SIAM J. Discret. Math., 2015)

Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture. - Florent Foucaud; Michael A. Henning (Electron. J. Comb., 2016)

Transversals in 4-Uniform Hypergraphs. - Michael A. Henning; Anders Yeo (Electron. J. Comb., 2016)

Game total domination for cycles and paths. - Paul Dorbec; Michael A. Henning (Discret. Appl. Math., 2016)

Locating-dominating sets in twin-free graphs. - Florent Foucaud; Michael A. Henning; Christian Löwenstein; Thomas Sasse (Discret. Appl. Math., 2016)

Largest domination number and smallest independence number of forests with given degree sequence. - Michael Gentner; Michael A. Henning; Dieter Rautenbach (Discret. Appl. Math., 2016)

Induced 2-regular subgraphs in k-chordal cubic graphs. - Michael A. Henning; Felix Joos; Christian Löwenstein; Dieter Rautenbach (Discret. Appl. Math., 2016)

Trees with large m-eternal domination number. - Michael A. Henning; William F. Klostermeyer (Discret. Appl. Math., 2016)

Total dominating sequences in graphs. - Bostjan Bresar; Michael A. Henning; Douglas F. Rall (Discret. Math., 2016)

Independence in 5-uniform hypergraphs. - Alex Eustis; Michael A. Henning; Anders Yeo (Discret. Math., 2016)

Location-domination and matching in cubic graphs. - Florent Foucaud; Michael A. Henning (Discret. Math., 2016)

Progress towards the total domination game -conjecture. - Michael A. Henning; Douglas F. Rall (Discret. Math., 2016)

A note on non-dominating set partitions in graphs. - Wyatt J. Desormeaux; Teresa W. Haynes; Michael A. Henning (Discuss. Math. Graph Theory, 2016)

A characterization of hypergraphs with large domination number. - Michael A. Henning; Christian Löwenstein (Discuss. Math. Graph Theory, 2016)

Vertices contained in all or in no minimum semitotal dominating set of a tree. - Michael A. Henning; Alister J. Marcon (Discuss. Math. Graph Theory, 2016)

Bounds on the disjunctive total domination number of a tree. - Michael A. Henning; Viroshan Naicker (Discuss. Math. Graph Theory, 2016)

Induced Cycles in Graphs. - Michael A. Henning; Felix Joos; Christian Löwenstein; Thomas Sasse (Graphs Comb., 2016)

Signed Roman k-Domination in Graphs. - Michael A. Henning; Lutz Volkmann (Graphs Comb., 2016)

Lower bounds on the total domination number of a graph. - Wyatt J. Desormeaux; Michael A. Henning (J. Comb. Optim., 2016)

Disjunctive total domination in graphs. - Michael A. Henning; Viroshan Naicker (J. Comb. Optim., 2016)

The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3. - Michael A. Henning; Christian Löwenstein (J. Graph Theory, 2016)

Transversal Game on Hypergraphs and the 3/4-Conjecture on the Total Domination Game. - Csilla Bujtás; Michael A. Henning; Zsolt Tuza (SIAM J. Discret. Math., 2016)

Domination Game: A proof of the 3/5-Conjecture for Graphs with Minimum Degree at Least Two. - Michael A. Henning; William B. Kinnersley (SIAM J. Discret. Math., 2016)

Lower Bounds on the Distance Domination Number of a Graph. - Randy Davila; Caleb Fast; Michael A. Henning; Franklin Kenter (Contributions Discret. Math., 2017)

Bounds for the $m$-Eternal Domination Number of a Graph. - Michael A. Henning; William Klostermeyer; Gary MacGillivray (Contributions Discret. Math., 2017)

The 4/5 upper bound on the game total domination number. - Michael A. Henning; Sandi Klavzar; Douglas F. Rall (Comb., 2017)

(Total) Domination in Prisms. - Jernej Azarija; Michael A. Henning; Sandi Klavzar (Electron. J. Comb., 2017)

Transversals and Independence in Linear Hypergraphs with Maximum Degree Two. - Michael A. Henning; Anders Yeo (Electron. J. Comb., 2017)

Partitioning the vertices of a cubic graph into two total dominating sets. - Wyatt J. Desormeaux; Teresa W. Haynes; Michael A. Henning (Discret. Appl. Math., 2017)

Italian domination in trees. - Michael A. Henning; William F. Klostermeyer (Discret. Appl. Math., 2017)

Trees with equal total domination and game total domination numbers. - Michael A. Henning; Douglas F. Rall (Discret. Appl. Math., 2017)

Relating domination, exponential domination, and porous exponential domination. - Michael A. Henning; Simon Jäger; Dieter Rautenbach (Discret. Optim., 2017)

Location-domination in line graphs. - Florent Foucaud; Michael A. Henning (Discret. Math., 2017)

Matchings, path covers and domination. - Michael A. Henning; Kirsti Wash (Discret. Math., 2017)

A note on fractional disjoint transversals in hypergraphs. - Michael A. Henning; Anders Yeo (Discret. Math., 2017)

Domination game: extremal families for 3/5-conjecture for forests. - Michael A. Henning; Christian Löwenstein (Discuss. Math. Graph Theory, 2017)

A characterization of trees with equal 2-domination and 2-independence numbers. - Christoph Brause; Michael A. Henning; Marcin Krzywkowski (Discret. Math. Theor. Comput. Sci., 2017)

Bounds on the game transversal number in hypergraphs. - Csilla Bujtás; Michael A. Henning; Zsolt Tuza (Eur. J. Comb., 2017)

Edge Weighting Functions on Semitotal Dominating Sets. - Michael A. Henning (Graphs Comb., 2017)

On 2-Step and Hop Dominating Sets in Graphs. - Michael A. Henning; Nader Jafari Rad (Graphs Comb., 2017)

The game total domination problem is log-complete in PSPACE. - Bostjan Bresar; Michael A. Henning (Inf. Process. Lett., 2017)

Distance domination in graphs with given minimum and maximum degree. - Michael A. Henning; Nicolas Lichiardopol (J. Comb. Optim., 2017)

A New Lower Bound on the Total Domination Number of a Tree. - Wyatt J. Desormeaux; Michael A. Henning (Ars Comb., 2018)

On Upper Transversals in 3-Uniform Hypergraphs. - Michael A. Henning; Anders Yeo (Electron. J. Comb., 2018)

On upper bounds for the independent transversal domination number. - Christoph Brause; Michael A. Henning; Kenta Ozeki; Ingo Schiermeyer; Elkin Vumar (Discret. Appl. Math., 2018)

The matcher game played in graphs. - Wayne Goddard; Michael A. Henning (Discret. Appl. Math., 2018)

Essential upper bounds on the total domination number. - Michael A. Henning (Discret. Appl. Math., 2018)

Total domination stability in graphs. - Michael A. Henning; Marcin Krzywkowski (Discret. Appl. Math., 2018)

Perfect Roman domination in trees. - Michael A. Henning; William F. Klostermeyer; Gary MacGillivray (Discret. Appl. Math., 2018)

Game total domination critical graphs. - Michael A. Henning; Sandi Klavzar; Douglas F. Rall (Discret. Appl. Math., 2018)

k-broadcast domination and k-multipacking. - Michael A. Henning; Gary MacGillivray; Frank Yang (Discret. Appl. Math., 2018)

Independent domination in subcubic graphs of girth at least six. - Gholamreza Abrishami; Michael A. Henning (Discret. Math., 2018)

Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs. - Michael A. Henning; Anders Yeo (Discret. Math., 2018)

Total domination in versus paired-domination in regular graphs. - Joanna Cyman; Magda Dettlaff; Michael A. Henning; Magdalena Lemanska; Joanna Raczek (Discuss. Math. Graph Theory, 2018)

Domination parameters of a graph and its complement. - Wyatt J. Desormeaux; Teresa W. Haynes; Michael A. Henning (Discuss. Math. Graph Theory, 2018)

Hereditary equality of domination and exponential domination. - Michael A. Henning; Simon Jäger; Dieter Rautenbach (Discuss. Math. Graph Theory, 2018)

Total Domination Versus Domination in Cubic Graphs. - Joanna Cyman; Magda Dettlaff; Michael A. Henning; Magdalena Lemanska; Joanna Raczek (Graphs Comb., 2018)

Total Forcing and Zero Forcing in Claw-Free Cubic Graphs. - Randy Davila; Michael A. Henning (Graphs Comb., 2018)

Bounds on the Connected Forcing Number of a Graph. - Randy Davila; Michael A. Henning; Colton Magnant; Ryan Pepper (Graphs Comb., 2018)

Semipaired Domination in Claw-Free Cubic Graphs. - Michael A. Henning; Pawaton Kaemawichanurat (Graphs Comb., 2018)

A note on domination and total domination in prisms. - Wayne Goddard; Michael A. Henning (J. Comb. Optim., 2018)

Perfect graphs involving semitotal and semipaired domination. - Teresa W. Haynes; Michael A. Henning (J. Comb. Optim., 2018)

Smallest domination number and largest independence number of graphs and forests with given degree sequence. - Michael Gentner; Michael A. Henning; Dieter Rautenbach (J. Graph Theory, 2018)

Thoroughly dispersed colorings. - Wayne Goddard; Michael A. Henning (J. Graph Theory, 2018)

Tight lower bounds on the matching number in a graph with given maximum degree. - Michael A. Henning; Anders Yeo (J. Graph Theory, 2018)

Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension. - Laurent Beaudou; Peter Dankelmann; Florent Foucaud; Michael A. Henning; Arnaud Mary; Aline Parreau (SIAM J. Discret. Math., 2018)

Total forcing versus total domination in cubic graphs. - Randy Davila; Michael A. Henning (Appl. Math. Comput., 2019)

A characterization of graphs with disjoint total dominating sets. - Michael A. Henning; Iztok Peterin (Ars Math. Contemp., 2019)

On the total forcing number of a graph. - Randy Davila; Michael A. Henning (Discret. Appl. Math., 2019)

Uniquely restricted matchings in subcubic graphs. - Maximilian Fürst; Michael A. Henning; Dieter Rautenbach (Discret. Appl. Math., 2019)

Perfect Italian domination in trees. - Teresa W. Haynes; Michael A. Henning (Discret. Appl. Math., 2019)

A characterization of double Roman trees. - Michael A. Henning; Nader Jafari Rad (Discret. Appl. Math., 2019)

Cutting lemma and union lemma for the domination game. - Paul Dorbec; Michael A. Henning; Sandi Klavzar; Gasper Kosmrlj (Discret. Math., 2019)

A note on improved upper bounds on the transversal number of hypergraphs. - Michael A. Henning; Nader Jafari Rad (Discret. Math. Algorithms Appl., 2019)

On independent domination in planar, cubic graphs. - Gholamreza Abrishami; Michael A. Henning; Freydoon Rahbarnia (Discuss. Math. Graph Theory, 2019)

On accurate domination in graphs. - Joanna Cyman; Michael A. Henning; Jerzy Topp (Discuss. Math. Graph Theory, 2019)

Graphs with large semipared domination number. - Teresa W. Haynes; Michael A. Henning (Discuss. Math. Graph Theory, 2019)

On the maximum number of minimum total dominating sets in forests. - Michael A. Henning; Elena Mohr; Dieter Rautenbach (Discret. Math. Theor. Comput. Sci., 2019)

Upper transversals in hypergraphs. - Michael A. Henning; Anders Yeo (Eur. J. Comb., 2019)

Independent Domination in Bipartite Cubic Graphs. - Christoph Brause; Michael A. Henning (Graphs Comb., 2019)

A new lower bound on the domination number of a graph. - Majid Hajian; Michael A. Henning; Nader Jafari Rad (J. Comb. Optim., 2019)

Semipaired domination in maximal outerplanar graphs. - Michael A. Henning; Pawaton Kaemawichanurat (J. Comb. Optim., 2019)

Algorithmic aspects of semitotal domination in graphs. - Michael A. Henning; Arti Pandey (Theor. Comput. Sci., 2019)

Independent domination, colorings and the fractional idomatic number of a graph. - Wayne Goddard; Michael A. Henning (Appl. Math. Comput., 2020)

Traceability of connected domination critical graphs. - Michael A. Henning; Nawarat Ananchuen; Pawaton Kaemawichanurat (Appl. Math. Comput., 2020)

Domination versus edge domination. - Julien Baste; Maximilian Fürst; Michael A. Henning; Elena Mohr; Dieter Rautenbach (Discret. Appl. Math., 2020)

Total domination cover rubbling. - Robert A. Beeler; Teresa W. Haynes; Michael A. Henning; Rodney Keaton (Discret. Appl. Math., 2020)

A 34-approximation of Vizing's conjecture for claw-free graphs. - Bostjan Bresar; Michael A. Henning (Discret. Appl. Math., 2020)

Maker-Breaker total domination game. - Valentin Gledel; Michael A. Henning; Vesna Irsic; Sandi Klavzar (Discret. Appl. Math., 2020)

2-limited broadcast domination in subcubic graphs. - Michael A. Henning; Gary MacGillivray; Frank Yang (Discret. Appl. Math., 2020)

Domination versus independent domination in graphs of small regularity. - Ammar Babikir; Michael A. Henning (Discret. Math., 2020)

Total forcing sets and zero forcing sets in trees. - Randy Davila; Michael A. Henning (Discuss. Math. Graph Theory, 2020)

Equating k maximum degrees in graphs without short cycles. - Maximilian Fürst; Michael Gentner; Michael A. Henning; Simon Jäger; Dieter Rautenbach (Discuss. Math. Graph Theory, 2020)

Trees with Unique Minimum Semitotal Dominating Sets. - Teresa W. Haynes; Michael A. Henning (Graphs Comb., 2020)

Algorithm and hardness results on hop domination in graphs. - Michael A. Henning; Saikat Pal; Dinabandhu Pradhan (Inf. Process. Lett., 2020)

Algorithmic results on double Roman domination in graphs. - S. Banerjee; Michael A. Henning; Dinabandhu Pradhan (J. Comb. Optim., 2020)

Bounds on upper transversals in hypergraphs. - Michael A. Henning; Anders Yeo (J. Comb. Optim., 2020)

Complexity and Algorithms for Semipaired Domination in Graphs. - Michael A. Henning; Arti Pandey; Vikash Tripathi (Theory Comput. Syst., 2020)

Algorithmic aspects of upper paired-domination in graphs. - Michael A. Henning; Dinabandhu Pradhan (Theor. Comput. Sci., 2020)

Approximation Algorithm and Hardness Results for Defensive Domination in Graphs. - Michael A. Henning; Arti Pandey; Vikash Tripathi (COCOA, 2021)

Perfect Italian domination in cographs. - S. Banerjee; Michael A. Henning; Dinabandhu Pradhan (Appl. Math. Comput., 2021)

Connected domination critical graphs with a block having maximum number of cut vertices. - Michael A. Henning; Pawaton Kaemawichanurat (Appl. Math. Comput., 2021)

The enclaveless competition game. - Michael A. Henning; Douglas F. Rall (Ars Math. Contemp., 2021)

A new upper bound on the total domination number in graphs with minimum degree six. - Michael A. Henning; Anders Yeo (Discret. Appl. Math., 2021)

Lower bounds on Tuza constants for transversals in linear uniform hypergraphs. - Michael A. Henning; Anders Yeo (Discret. Appl. Math., 2021)

Bounding and approximating minimum maximal matchings in regular graphs. - Julien Baste; Maximilian Fürst; Michael A. Henning; Elena Mohr; Dieter Rautenbach (Discret. Math., 2021)

On the domination number of graphs with minimum degree six. - Csilla Bujtás; Michael A. Henning (Discret. Math., 2021)

On (1, 2)-domination in cubic graphs. - Mohammadhossein Fakharan; Ali A. Gorzin; Michael A. Henning; Amir Jafari; Rouzbeh Tusserkani (Discret. Math., 2021)

A characterization of graphs with given maximum degree and smallest possible matching number. - Michael A. Henning; Zekhaya B. Shozi (Discret. Math., 2021)

Matching and edge-connectivity in graphs with given maximum degree. - Michael A. Henning; Anders Yeo (Discret. Math., 2021)

A new framework to approach Vizing's conjecture. - Bostjan Bresar; Bert L. Hartnell; Michael A. Henning; Kirsti Kuenzel; Douglas F. Rall (Discuss. Math. Graph Theory, 2021)

Restrained domination in self-complementary graphs. - Wyatt J. Desormeaux; Teresa W. Haynes; Michael A. Henning (Discuss. Math. Graph Theory, 2021)

Minimal graphs with disjoint dominating and paired-dominating sets. - Michael A. Henning; Jerzy Topp (Discuss. Math. Graph Theory, 2021)

Semipaired Domination in Some Subclasses of Chordal Graphs. - Michael A. Henning; Arti Pandey; Vikash Tripathi (Discret. Math. Theor. Comput. Sci., 2021)

Independent Domination Subdivision in Graphs. - Ammar Babikir; Magda Dettlaff; Michael A. Henning; Magdalena Lemanska (Graphs Comb., 2021)

Upper Bounds on the k-Tuple (Roman) Domination Number of a Graph. - Michael A. Henning; Nader Jafari Rad (Graphs Comb., 2021)

Affine Planes and Transversals in 3-Uniform Linear Hypergraphs. - Michael A. Henning; Anders Yeo (Graphs Comb., 2021)

Zero forcing versus domination in cubic graphs. - Randy Davila; Michael A. Henning (J. Comb. Optim., 2021)

Bounds on the semipaired domination number of graphs with minimum degree at least two. - Teresa W. Haynes; Michael A. Henning (J. Comb. Optim., 2021)

A characterization of the subcubic graphs achieving equality in the Haxell-Scott lower bound for the matching number. - Michael A. Henning; Zekhaya B. Shozi (J. Graph Theory, 2021)

Graphs with disjoint $2$-dominating sets. - Michael A. Henning; Jerzy Topp (Australas. J Comb., 2022)

Compelling colorings: A generalization of the dominator chromatic number. - Anna Bachstein; Wayne Goddard; Michael A. Henning; John Xue (Appl. Math. Comput., 2022)

Bounds on the paired domination number of graphs with minimum degree at least three. - Michael A. Henning; Monika Pilsniak; Elzbieta Tumidajewicz (Appl. Math. Comput., 2022)

Paired domination stability in graphs. - Aleksandra Gorzkowska; Michael A. Henning; Monika Pilsniak; Elzbieta Tumidajewicz (Ars Math. Contemp., 2022)

Domination and dominator colorings in planar graphs with small diameter. - Wayne Goddard; Michael A. Henning (Discret. Appl. Math., 2022)

Local metric dimension for graphs with small clique numbers. - Gholamreza Abrishami; Michael A. Henning; Mostafa Tavakoli (Discret. Math., 2022)

Domination versus total domination in claw-free cubic graphs. - Ammar Babikir; Michael A. Henning (Discret. Math., 2022)

A characterization of graphs with given maximum degree and smallest possible matching number: II. - Michael A. Henning; Zekhaya B. Shozi (Discret. Math., 2022)

A classification of cactus graphs according to their domination number. - Majid Hajian; Michael A. Henning; Nader Jafari Rad (Discuss. Math. Graph Theory, 2022)

Bounds on domination parameters in graphs: a brief survey. - Michael A. Henning (Discuss. Math. Graph Theory, 2022)

The semitotal domination problem in block graphs. - Michael A. Henning; Saikat Pal; Dinabandhu Pradhan (Discuss. Math. Graph Theory, 2022)

An Improved Upper Bound on the Independent Domination Number in Cubic Graphs of Girth at Least Six. - Gholamreza Abrishami; Michael A. Henning (Graphs Comb., 2022)

Improved Bounds on the k-tuple (Roman) Domination Number of a Graph. - Noor A'lawiah Abd Aziz; Michael A. Henning; Nader Jafari Rad; Hailiza Kamarulhaili (Graphs Comb., 2022)

Triangles and (Total) Domination in Subcubic Graphs. - Ammar Babikir; Michael A. Henning (Graphs Comb., 2022)

Upper Total Domination in Claw-Free Cubic Graphs. - Ammar Babikir; Michael A. Henning (Graphs Comb., 2022)

Paired Domination in Trees. - Aleksandra Gorzkowska; Michael A. Henning; Elzbieta Kleszcz; Monika Pilsniak (Graphs Comb., 2022)

Independent domination in subcubic graphs. - Amirreza Akbari; Saieed Akbari; Ali Doosthosseini; Zahra Hadizadeh; Michael A. Henning; A. Naraghi (J. Comb. Optim., 2022)

A complete description of convex sets associated with matchings and edge-connectivity in graphs. - Michael A. Henning; Anders Yeo (J. Graph Theory, 2022)

The minmin coalition number in graphs. - Davood Bakhshesh; Michael A. Henning (CoRR, 2023)

Independent domination in outerplanar graphs. - Wayne Goddard; Michael A. Henning (Discret. Appl. Math., 2023)

A generalization of Petersen's matching theorem. - Michael A. Henning; Zekhaya B. Shozi (Discret. Math., 2023)

Zero and total forcing dense graphs. - Randy Davila; Michael A. Henning; Ryan Pepper (Discuss. Math. Graph Theory, 2023)

Total and paired domination stability in prisms. - Aleksandra Gorzkowska; Michael A. Henning; Monika Pilsniak; Elzbieta Tumidajewicz (Discuss. Math. Graph Theory, 2023)

Unique minimum semipaired dominating sets in trees. - Teresa W. Haynes; Michael A. Henning (Discuss. Math. Graph Theory, 2023)

Hop domination in chordal bipartite graphs. - Michael A. Henning; Saikat Pal; Dinabandhu Pradhan (Discuss. Math. Graph Theory, 2023)

On a Conjecture About the Local Metric Dimension of Graphs. - Ali Ghalavand; Michael A. Henning; Mostafa Tavakoli (Graphs Comb., 2023)

Algorithmic aspects of paired disjunctive domination in graphs. - Michael A. Henning; Arti Pandey; Vikash Tripathi (Theor. Comput. Sci., 2023)

The Tuza-Vestergaard Theorem. - Michael A. Henning; Christian Löwenstein; Anders Yeo (SIAM J. Discret. Math., 2023)

Paired-domination game played on cycles. - Aaron D. Gray; Michael A. Henning (Discret. Appl. Math., 2023)

Graphs with Unique Minimum Specified Domination Sets. - Wayne Goddard; Michael A. Henning (Graphs Comb., 2023)

Complexity of Total Dominator Coloring in Graphs. - Michael A. Henning; Kusum; Arti Pandey; Kaustav Paul (Graphs Comb., 2023)

Domination parameters and the removal of matchings. - Geoffrey Boyer; Wayne Goddard; Michael A. Henning (Appl. Math. Comput., 2024)

The Sierpiński domination number. - Michael A. Henning; Sandi Klavzar; Elzbieta Kleszcz; Monika Pilsniak (Ars Math. Contemp., 2024)

The 1/3-conjectures for domination in cubic graphs. - Paul Dorbec; Michael Anthony Henning (CoRR, 2024)

A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set. - Teresa W. Haynes; Michael A. Henning (Discret. Appl. Math., 2024)

A characterization of graphs with given total coalition numbers. - Michael A. Henning; Shahin N. Jogan (Discret. Appl. Math., 2024)

The packing number of cubic graphs. - Wayne Goddard; Michael A. Henning (Discret. Optim., 2024)

Mostar index and bounded maximum degree. - Michael A. Henning; Johannes Pardey; Dieter Rautenbach; Florian Werner 003 (Discret. Optim., 2024)

Progress towards the two-thirds conjecture on locating-total dominating sets. - Dipayan Chakraborty; Florent Foucaud; Anni Hakanen; Michael A. Henning; Annegret Katrin Wagler (Discret. Math., 2024)

Minimal graphs with disjoint dominating and total dominating sets. - Michael A. Henning; Jerzy Topp (Discuss. Math. Graph Theory, 2024)

Best possible upper bounds on the restrained domination number of cubic graphs. - Bostjan Bresar; Michael A. Henning (J. Graph Theory, 2024)

Optimal linear-Vizing relationships for (total) domination in graphs. - Michael A. Henning; Paul Horn (J. Graph Theory, 2024)

Common domination perfect graphs. - Magda Dettlaff; Michael A. Henning; Jerzy Topp (Discret. Appl. Math., 2024)

Partial domination in supercubic graphs. - Csilla Bujtás; Michael A. Henning; Sandi Klavzar (Discret. Math., 2024)

Algorithms and hardness results for edge total domination problem in graphs. - Michael A. Henning; Arti Pandey; Gopika Sharma; Vikash Tripathi (Theor. Comput. Sci., 2024)

On the cycle-path bipartite Ramsey number. - Ernst J. Joubert; Michael A. Henning (Discret. Math., 2024)

Singleton coalition graph chains. - Davood Bakhshesh; Michael A. Henning; Dinabandhu Pradhan (Comput. Appl. Math., 2024)

Transversals in regular uniform hypergraphs. - Michael A. Henning; Anders Yeo (J. Graph Theory, 2024)

Partitioning the vertices of a graph or its complement into a total dominating set and an independent dominating set. - Teresa W. Haynes; Michael A. Henning (Australas. J Comb., 2024)

Local edge metric dimensions via corona products and integer linear programming. - Fateme Amini; Michael A. Henning; Mostafa Tavakoli (Comput. Appl. Math., 2024)

k-Domination ivariants on Kneser graphs. - Bostjan Bresar; Tanja Dravec; María Gracia Cornet; Michael A. Henning (Ars Math. Contemp., 2025)

Indicated total domination game. - Michael A. Henning; Douglas F. Rall (Ars Math. Contemp., 2025)

Paired-domination in binary trees. - Aaron D. Gray; Michael A. Henning (Discret. Appl. Math., 2025)

More on the complexity of defensive domination in graphs. - Michael A. Henning; Arti Pandey; Vikash Tripathi (Discret. Appl. Math., 2025)

On the domination number of graphs with minimum degree at least seven. - Csilla Bujtás; Michael A. Henning (Discret. Math., 2025)

Transversal coalitions in hypergraphs. - Michael A. Henning; Anders Yeo (Discret. Math., 2025)

End super dominating sets in graphs. - Saieed Akbari; Nima Ghanbari; Michael A. Henning (Discuss. Math. Graph Theory, 2025)

Complementary coalition graphs: characterization and algorithm. - Davood Bakhshesh; Michael A. Henning (Discuss. Math. Graph Theory, 2025)

Characterization of α-excellent 2-trees. - Magda Dettlaff; Michael A. Henning; Jerzy Topp (Discuss. Math. Graph Theory, 2025)

3-neighbor bootstrap percolation on grids. - Jaka Hedzet; Michael A. Henning (Discuss. Math. Graph Theory, 2025)

Extensions and applications of the Tuza-Vestergaard theorem. - Michael A. Henning; Anders Yeo (Eur. J. Comb., 2025)

Paired versus double domination in forbidden graph classes. - Michael A. Henning; Paras Maniya; Dinabandhu Pradhan (Comput. Appl. Math., 2025)

Secure domination in P5-free graphs. - Paras Maniya; Uttam K. Gupta; Michael A. Henning; Dinabandhu Pradhan (CoRR, 2025)

Disjunctive domination in maximal outerplanar graphs. - Michael A. Henning; Paras Maniya; Dinabandhu Pradhan (CoRR, 2025)

Double Coalitions in Regular Graphs. - Michael A. Henning; Doost Ali Mojdeh (Graphs Comb., 2025)

New probabilistic upper bounds on the domination number of a graph: II. - Michael A. Henning; Nader Jafari Rad (Discret. Math., 2026)