Michael A. Henning

ORCID

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 172

Top Venues

Discret. Appl. Math.

Discret. Math.

Graphs Comb.

Discuss. Math. Graph Theory

Publications

Geoffrey Boyer, Wayne Goddard, Michael A. Henning
Domination parameters and the removal of matchings. Appl. Math. Comput. 476 (2024)
Michael A. Henning, Anders Yeo
Transversals in regular uniform hypergraphs. J. Graph Theory 105 (3) (2024)
Michael A. Henning, Jerzy Topp
Minimal graphs with disjoint dominating and total dominating sets. Discuss. Math. Graph Theory 44 (1) (2024)
Fateme Amini, Michael A. Henning, Mostafa Tavakoli
Local edge metric dimensions via corona products and integer linear programming. Comput. Appl. Math. 43 (6) (2024)
Csilla Bujtás, Michael A. Henning, Sandi Klavzar
Partial domination in supercubic graphs. Discret. Math. 347 (1) (2024)
Ernst J. Joubert, Michael A. Henning
On the cycle-path bipartite Ramsey number. Discret. Math. 347 (2) (2024)
Teresa W. Haynes, Michael A. Henning
A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set. Discret. Appl. Math. 358 (2024)
Davood Bakhshesh, Michael A. Henning, Dinabandhu Pradhan
Singleton coalition graph chains. Comput. Appl. Math. 43 (2) (2024)
Michael A. Henning, Arti Pandey, Gopika Sharma, Vikash Tripathi
Algorithms and hardness results for edge total domination problem in graphs. Theor. Comput. Sci. 982 (2024)
Michael A. Henning, Shahin N. Jogan
A characterization of graphs with given total coalition numbers. Discret. Appl. Math. 358 (2024)
Magda Dettlaff, Michael A. Henning, Jerzy Topp
Common domination perfect graphs. Discret. Appl. Math. 342 (2024)
Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret Katrin Wagler
Progress towards the two-thirds conjecture on locating-total dominating sets. Discret. Math. 347 (12) (2024)
Wayne Goddard, Michael A. Henning
The packing number of cubic graphs. Discret. Optim. 53 (2024)
Teresa W. Haynes, Michael A. Henning
Partitioning the vertices of a graph or its complement into a total dominating set and an independent dominating set. Australas. J Comb. 89 (2024)
Davood Bakhshesh, Michael A. Henning
The minmin coalition number in graphs. CoRR (2023)
Michael A. Henning, Christian Löwenstein, Anders Yeo
The Tuza-Vestergaard Theorem. SIAM J. Discret. Math. 37 (2) (2023)
Michael A. Henning, Saikat Pal, Dinabandhu Pradhan
Hop domination in chordal bipartite graphs. Discuss. Math. Graph Theory 43 (3) (2023)
Wayne Goddard, Michael A. Henning
Graphs with Unique Minimum Specified Domination Sets. Graphs Comb. 39 (5) (2023)
Randy Davila, Michael A. Henning, Ryan Pepper
Zero and total forcing dense graphs. Discuss. Math. Graph Theory 43 (3) (2023)
Michael A. Henning, Kusum, Arti Pandey, Kaustav Paul
Complexity of Total Dominator Coloring in Graphs. Graphs Comb. 39 (6) (2023)
Aleksandra Gorzkowska, Michael A. Henning, Monika Pilsniak, Elzbieta Tumidajewicz
Total and paired domination stability in prisms. Discuss. Math. Graph Theory 43 (4) (2023)
Ali Ghalavand, Michael A. Henning, Mostafa Tavakoli
On a Conjecture About the Local Metric Dimension of Graphs. Graphs Comb. 39 (1) (2023)
Michael A. Henning, Zekhaya B. Shozi
A generalization of Petersen's matching theorem. Discret. Math. 346 (3) (2023)
Michael A. Henning, Arti Pandey, Vikash Tripathi
Algorithmic aspects of paired disjunctive domination in graphs. Theor. Comput. Sci. (2023)
Teresa W. Haynes, Michael A. Henning
Unique minimum semipaired dominating sets in trees. Discuss. Math. Graph Theory 43 (1) (2023)
Wayne Goddard, Michael A. Henning
Independent domination in outerplanar graphs. Discret. Appl. Math. 325 (2023)
Michael A. Henning, Kusum, Arti Pandey, Kaustav Paul
Complexity of total dominator coloring in graphs. CoRR (2023)
Aaron D. Gray, Michael A. Henning
Paired-domination game played on cycles. Discret. Appl. Math. 336 (2023)
Davood Bakhshesh, Michael A. Henning, Dinabandhu Pradhan
Singleton Coalition Graph Chains. CoRR (2023)
Michael A. Henning, Saikat Pal, Dinabandhu Pradhan
The semitotal domination problem in block graphs. Discuss. Math. Graph Theory 42 (1) (2022)
Wayne Goddard, Michael A. Henning
Domination and dominator colorings in planar graphs with small diameter. Discret. Appl. Math. 313 (2022)
Gholamreza Abrishami, Michael A. Henning, Mostafa Tavakoli
Local metric dimension for graphs with small clique numbers. Discret. Math. 345 (4) (2022)
Ammar Babikir, Michael A. Henning
Domination versus total domination in claw-free cubic graphs. Discret. Math. 345 (4) (2022)
Noor A'lawiah Abd Aziz, Michael A. Henning, Nader Jafari Rad, Hailiza Kamarulhaili
Improved Bounds on the k-tuple (Roman) Domination Number of a Graph. Graphs Comb. 38 (3) (2022)
Aleksandra Gorzkowska, Michael A. Henning, Monika Pilsniak, Elzbieta Tumidajewicz
Paired domination stability in graphs. Ars Math. Contemp. 22 (2) (2022)
Ammar Babikir, Michael A. Henning
Upper Total Domination in Claw-Free Cubic Graphs. Graphs Comb. 38 (6) (2022)
Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret Wagler
Progress towards the two-thirds conjecture on locating-total dominating sets. CoRR (2022)
Michael A. Henning, Zekhaya B. Shozi
A characterization of graphs with given maximum degree and smallest possible matching number: II. Discret. Math. 345 (3) (2022)
Michael A. Henning, Jerzy Topp
Graphs with disjoint $2$-dominating sets. Australas. J Comb. 83 (2022)
Amirreza Akbari, Saieed Akbari, Ali Doosthosseini, Z. Hadizadeh, Michael A. Henning, A. Naraghi
Independent domination in subcubic graphs. J. Comb. Optim. 43 (1) (2022)
Gholamreza Abrishami, Michael A. Henning
An Improved Upper Bound on the Independent Domination Number in Cubic Graphs of Girth at Least Six. Graphs Comb. 38 (2) (2022)
Ammar Babikir, Michael A. Henning
Triangles and (Total) Domination in Subcubic Graphs. Graphs Comb. 38 (2) (2022)
Aleksandra Gorzkowska, Michael A. Henning, Elzbieta Kleszcz, Monika Pilsniak
Paired Domination in Trees. Graphs Comb. 38 (4) (2022)
Majid Hajian, Michael A. Henning, Nader Jafari Rad
A classification of cactus graphs according to their domination number. Discuss. Math. Graph Theory 42 (2) (2022)
Michael A. Henning, Anders Yeo
A complete description of convex sets associated with matchings and edge-connectivity in graphs. J. Graph Theory 101 (4) (2022)
Anna Bachstein, Wayne Goddard, Michael A. Henning, John Xue
Compelling colorings: A generalization of the dominator chromatic number. Appl. Math. Comput. 428 (2022)
Michael A. Henning
Bounds on domination parameters in graphs: a brief survey. Discuss. Math. Graph Theory 42 (3) (2022)
Michael A. Henning, Monika Pilsniak, Elzbieta Tumidajewicz
Bounds on the paired domination number of graphs with minimum degree at least three. Appl. Math. Comput. 417 (2022)
Ammar Babikir, Magda Dettlaff, Michael A. Henning, Magdalena Lemanska
Independent Domination Subdivision in Graphs. Graphs Comb. 37 (3) (2021)
Bostjan Bresar, Bert L. Hartnell, Michael A. Henning, Kirsti Kuenzel, Douglas F. Rall
A new framework to approach Vizing's conjecture. Discuss. Math. Graph Theory 41 (3) (2021)
Michael A. Henning, Anders Yeo
A new upper bound on the total domination number in graphs with minimum degree six. Discret. Appl. Math. 302 (2021)
Randy Davila, Michael A. Henning
Zero forcing versus domination in cubic graphs. J. Comb. Optim. 41 (2) (2021)
Michael A. Henning, Pawaton Kaemawichanurat
Connected domination critical graphs with a block having maximum number of cut vertices. Appl. Math. Comput. 406 (2021)
Julien Baste, Maximilian Fürst, Michael A. Henning, Elena Mohr, Dieter Rautenbach
Bounding and approximating minimum maximal matchings in regular graphs. Discret. Math. 344 (3) (2021)
Michael A. Henning, Anders Yeo
Lower bounds on Tuza constants for transversals in linear uniform hypergraphs. Discret. Appl. Math. 304 (2021)
Michael A. Henning, Arti Pandey, Vikash Tripathi
Approximation Algorithm and Hardness Results for Defensive Domination in Graphs. COCOA (2021)
Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning
Restrained domination in self-complementary graphs. Discuss. Math. Graph Theory 41 (2) (2021)
S. Banerjee, Michael A. Henning, Dinabandhu Pradhan
Perfect Italian domination in cographs. Appl. Math. Comput. 391 (2021)
Teresa W. Haynes, Michael A. Henning
Bounds on the semipaired domination number of graphs with minimum degree at least two. J. Comb. Optim. 41 (2) (2021)
Mohammadhossein Fakharan, Ali A. Gorzin, Michael A. Henning, Amir Jafari, Rouzbeh Tusserkani
On (1, 2)-domination in cubic graphs. Discret. Math. 344 (10) (2021)
Michael A. Henning, Zekhaya B. Shozi
A characterization of the subcubic graphs achieving equality in the Haxell-Scott lower bound for the matching number. J. Graph Theory 96 (4) (2021)
Michael A. Henning, Anders Yeo
Affine Planes and Transversals in 3-Uniform Linear Hypergraphs. Graphs Comb. 37 (3) (2021)
Michael A. Henning, Zekhaya B. Shozi
A characterization of graphs with given maximum degree and smallest possible matching number. Discret. Math. 344 (7) (2021)
Michael A. Henning, Jerzy Topp
Minimal graphs with disjoint dominating and paired-dominating sets. Discuss. Math. Graph Theory 41 (3) (2021)
Michael A. Henning, Arti Pandey, Vikash Tripathi
Semipaired Domination in Some Subclasses of Chordal Graphs. Discret. Math. Theor. Comput. Sci. 23 (1) (2021)
Michael A. Henning, Anders Yeo
Matching and edge-connectivity in graphs with given maximum degree. Discret. Math. 344 (8) (2021)
Csilla Bujtás, Michael A. Henning
On the domination number of graphs with minimum degree six. Discret. Math. 344 (8) (2021)
Michael A. Henning, Douglas F. Rall
The enclaveless competition game. Ars Math. Contemp. 20 (1) (2021)
Michael A. Henning, Nader Jafari Rad
Upper Bounds on the k-Tuple (Roman) Domination Number of a Graph. Graphs Comb. 37 (1) (2021)
Robert A. Beeler, Teresa W. Haynes, Michael A. Henning, Rodney Keaton
Total domination cover rubbling. Discret. Appl. Math. 283 (2020)
Michael A. Henning, Nawarat Ananchuen, Pawaton Kaemawichanurat
Traceability of connected domination critical graphs. Appl. Math. Comput. 386 (2020)
Teresa W. Haynes, Michael A. Henning
Trees with Unique Minimum Semitotal Dominating Sets. Graphs Comb. 36 (3) (2020)
Amirreza Akbari, Saieed Akbari, Ali Doosthosseini, Z. Hadizadeh, Michael A. Henning, A. Naraghi
Independent Domination in Subcubic Graphs. CoRR (2020)
Randy Davila, Michael A. Henning
Total forcing sets and zero forcing sets in trees. Discuss. Math. Graph Theory 40 (3) (2020)
Valentin Gledel, Michael A. Henning, Vesna Irsic, Sandi Klavzar
Maker-Breaker total domination game. Discret. Appl. Math. 282 (2020)
Michael A. Henning, Dinabandhu Pradhan
Algorithmic aspects of upper paired-domination in graphs. Theor. Comput. Sci. 804 (2020)
Michael A. Henning, Arti Pandey, Vikash Tripathi
Semipaired Domination in Some Subclasses of Chordal Graphs. CoRR (2020)
Michael A. Henning, Anders Yeo
Bounds on upper transversals in hypergraphs. J. Comb. Optim. 39 (1) (2020)
Michael A. Henning, Gary MacGillivray, Frank Yang
2-limited broadcast domination in subcubic graphs. Discret. Appl. Math. 285 (2020)
Michael A. Henning, Arti Pandey, Vikash Tripathi
Complexity and Algorithms for Semipaired Domination in Graphs. Theory Comput. Syst. 64 (7) (2020)
Bostjan Bresar, Michael A. Henning
A 34-approximation of Vizing's conjecture for claw-free graphs. Discret. Appl. Math. 284 (2020)
Michael A. Henning, Saikat Pal, Dinabandhu Pradhan
Algorithm and hardness results on hop domination in graphs. Inf. Process. Lett. 153 (2020)
S. Banerjee, Michael A. Henning, Dinabandhu Pradhan
Algorithmic results on double Roman domination in graphs. J. Comb. Optim. 39 (1) (2020)
Wayne Goddard, Michael A. Henning
Independent domination, colorings and the fractional idomatic number of a graph. Appl. Math. Comput. 382 (2020)
Ammar Babikir, Michael A. Henning
Domination versus independent domination in graphs of small regularity. Discret. Math. 343 (7) (2020)
Maximilian Fürst, Michael Gentner, Michael A. Henning, Simon Jäger, Dieter Rautenbach
maximum degrees in graphs without short cycles. Discuss. Math. Graph Theory 40 (3) (2020)
Julien Baste, Maximilian Fürst, Michael A. Henning, Elena Mohr, Dieter Rautenbach
Domination versus edge domination. Discret. Appl. Math. 285 (2020)
Michael A. Henning, Arti Pandey, Vikash Tripathi
Complexity and Algorithms for Semipaired Domination in Graphs. CoRR (2019)
Michael A. Henning, Arti Pandey
Algorithmic aspects of semitotal domination in graphs. Theor. Comput. Sci. 766 (2019)
Majid Hajian, Michael A. Henning, Nader Jafari Rad
A new lower bound on the domination number of a graph. J. Comb. Optim. 38 (3) (2019)
Teresa W. Haynes, Michael A. Henning
Graphs with large semipared domination number. Discuss. Math. Graph Theory 39 (3) (2019)
Joanna Cyman, Michael A. Henning, Jerzy Topp
On accurate domination in graphs. Discuss. Math. Graph Theory 39 (3) (2019)
Michael A. Henning, Iztok Peterin
A characterization of graphs with disjoint total dominating sets. Ars Math. Contemp. 16 (2) (2019)
Randy Davila, Michael A. Henning
Total forcing versus total domination in cubic graphs. Appl. Math. Comput. 354 (2019)
Michael A. Henning, Elena Mohr, Dieter Rautenbach
On the maximum number of minimum total dominating sets in forests. Discret. Math. Theor. Comput. Sci. 21 (3) (2019)
Michael A. Henning, Pawaton Kaemawichanurat
Semipaired domination in maximal outerplanar graphs. J. Comb. Optim. 38 (3) (2019)
Michael A. Henning, Nader Jafari Rad
A note on improved upper bounds on the transversal number of hypergraphs. Discret. Math. Algorithms Appl. 11 (1) (2019)
Randy Davila, Michael A. Henning
On the total forcing number of a graph. Discret. Appl. Math. 257 (2019)
Michael A. Henning, Nader Jafari Rad
A characterization of double Roman trees. Discret. Appl. Math. 259 (2019)
Michael A. Henning, Arti Pandey, Vikash Tripathi
Complexity and Algorithms for Semipaired Domination in Graphs. IWOCA (2019)

Michael A. Henning.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michael A. Henning