default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael A. Henning
Michael Anthony Henning
Person information
- affiliation: University of Johannesburg, Department of Mathematics and Applied Mathematics, South Africa
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j426]Michael A. Henning, Paras Maniya, Dinabandhu Pradhan:
Paired versus double domination in forbidden graph classes. Comput. Appl. Math. 44(1): 71 (2025)- [j425]Michael A. Henning, Arti Pandey, Vikash Tripathi:
More on the complexity of defensive domination in graphs. Discret. Appl. Math. 362: 167-179 (2025) - [j424]Michael A. Henning
, Anders Yeo:
Transversal coalitions in hypergraphs. Discret. Math. 348(2): 114267 (2025) - [j423]Csilla Bujtás, Michael A. Henning:
On the domination number of graphs with minimum degree at least seven. Discret. Math. 348(6): 114424 (2025) - [j422]Saieed Akbari, Nima Ghanbari, Michael A. Henning:
End super dominating sets in graphs. Discuss. Math. Graph Theory 45(1): 21-47 (2025) - [j421]Magda Dettlaff, Michael A. Henning, Jerzy Topp:
Characterization of α-excellent 2-trees. Discuss. Math. Graph Theory 45(1): 67-80 (2025) - [j420]Jaka Hedzet, Michael A. Henning:
3-neighbor bootstrap percolation on grids. Discuss. Math. Graph Theory 45(1): 283-310 (2025) - 2024
- [j419]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: 97-115 (2024) - [j418]Geoffrey Boyer, Wayne Goddard, Michael A. Henning:
Domination parameters and the removal of matchings. Appl. Math. Comput. 476: 128752 (2024) - [j417]Davood Bakhshesh, Michael A. Henning, Dinabandhu Pradhan:
Singleton coalition graph chains. Comput. Appl. Math. 43(2): 85 (2024) - [j416]Fateme Amini, Michael A. Henning, Mostafa Tavakoli:
Local edge metric dimensions via corona products and integer linear programming. Comput. Appl. Math. 43(6): 358 (2024) - [j415]Magda Dettlaff, Michael A. Henning, Jerzy Topp:
Common domination perfect graphs. Discret. Appl. Math. 342: 253-259 (2024) - [j414]Michael A. Henning, Shahin N. Jogan:
A characterization of graphs with given total coalition numbers. Discret. Appl. Math. 358: 395-403 (2024) - [j413]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: 457-467 (2024) - [j412]Wayne Goddard, Michael A. Henning:
The packing number of cubic graphs. Discret. Optim. 53: 100850 (2024) - [j411]Michael A. Henning, Johannes Pardey, Dieter Rautenbach, Florian Werner:
Mostar index and bounded maximum degree. Discret. Optim. 54: 100861 (2024) - [j410]Csilla Bujtás, Michael A. Henning, Sandi Klavzar:
Partial domination in supercubic graphs. Discret. Math. 347(1): 113669 (2024) - [j409]Ernst J. Joubert, Michael A. Henning:
On the cycle-path bipartite Ramsey number. Discret. Math. 347(2): 113759 (2024) - [j408]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): 114176 (2024) - [j407]Michael A. Henning, Jerzy Topp:
Minimal graphs with disjoint dominating and total dominating sets. Discuss. Math. Graph Theory 44(1): 47 (2024) - [j406]Michael A. Henning, Anders Yeo:
Transversals in regular uniform hypergraphs. J. Graph Theory 105(3): 468-485 (2024) - [j405]Michael A. Henning, Arti Pandey, Gopika Sharma, Vikash Tripathi:
Algorithms and hardness results for edge total domination problem in graphs. Theor. Comput. Sci. 982: 114270 (2024) - [i9]Paul Dorbec, Michael Anthony Henning:
The 1/3-conjectures for domination in cubic graphs. CoRR abs/2401.17820 (2024) - 2023
- [j404]Wayne Goddard, Michael A. Henning:
Independent domination in outerplanar graphs. Discret. Appl. Math. 325: 52-57 (2023) - [j403]Aaron D. Gray, Michael A. Henning:
Paired-domination game played on cycles. Discret. Appl. Math. 336: 132-140 (2023) - [j402]Michael A. Henning, Zekhaya B. Shozi:
A generalization of Petersen's matching theorem. Discret. Math. 346(3): 113263 (2023) - [j401]Teresa W. Haynes, Michael A. Henning:
Unique minimum semipaired dominating sets in trees. Discuss. Math. Graph Theory 43(1): 35-53 (2023) - [j400]Randy Davila, Michael A. Henning, Ryan Pepper:
Zero and total forcing dense graphs. Discuss. Math. Graph Theory 43(3): 619-634 (2023) - [j399]Michael A. Henning, Saikat Pal, Dinabandhu Pradhan:
Hop domination in chordal bipartite graphs. Discuss. Math. Graph Theory 43(3): 825-840 (2023) - [j398]Aleksandra Gorzkowska, Michael A. Henning, Monika Pilsniak, Elzbieta Tumidajewicz:
Total and paired domination stability in prisms. Discuss. Math. Graph Theory 43(4): 1147-1169 (2023) - [j397]Ali Ghalavand, Michael A. Henning, Mostafa Tavakoli:
On a Conjecture About the Local Metric Dimension of Graphs. Graphs Comb. 39(1): 5 (2023) - [j396]Wayne Goddard, Michael A. Henning:
Graphs with Unique Minimum Specified Domination Sets. Graphs Comb. 39(5): 103 (2023) - [j395]Michael A. Henning, Kusum, Arti Pandey, Kaustav Paul:
Complexity of Total Dominator Coloring in Graphs. Graphs Comb. 39(6): 128 (2023) - [j394]Michael A. Henning, Christian Löwenstein, Anders Yeo:
The Tuza-Vestergaard Theorem. SIAM J. Discret. Math. 37(2): 1275-1310 (2023) - [j393]Michael A. Henning, Arti Pandey, Vikash Tripathi:
Algorithmic aspects of paired disjunctive domination in graphs. Theor. Comput. Sci. 966-967: 113990 (2023) - [i8]Michael A. Henning, Kusum, Arti Pandey, Kaustav Paul:
Complexity of total dominator coloring in graphs. CoRR abs/2303.01746 (2023) - [i7]Davood Bakhshesh, Michael A. Henning, Dinabandhu Pradhan:
Singleton Coalition Graph Chains. CoRR abs/2304.07606 (2023) - [i6]Davood Bakhshesh, Michael A. Henning:
The minmin coalition number in graphs. CoRR abs/2307.01222 (2023) - 2022
- [j392]Michael A. Henning, Jerzy Topp:
Graphs with disjoint $2$-dominating sets. Australas. J Comb. 83: 163-172 (2022) - [j391]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: 126782 (2022) - [j390]Anna Bachstein, Wayne Goddard, Michael A. Henning, John Xue:
Compelling colorings: A generalization of the dominator chromatic number. Appl. Math. Comput. 428: 127193 (2022) - [j389]Aleksandra Gorzkowska, Michael A. Henning, Monika Pilsniak, Elzbieta Tumidajewicz:
Paired domination stability in graphs. Ars Math. Contemp. 22(2): 2 (2022) - [j388]Wayne Goddard, Michael A. Henning:
Domination and dominator colorings in planar graphs with small diameter. Discret. Appl. Math. 313: 80-92 (2022) - [j387]Michael A. Henning, Zekhaya B. Shozi:
A characterization of graphs with given maximum degree and smallest possible matching number: II. Discret. Math. 345(3): 112731 (2022) - [j386]Gholamreza Abrishami, Michael A. Henning, Mostafa Tavakoli:
Local metric dimension for graphs with small clique numbers. Discret. Math. 345(4): 112763 (2022) - [j385]Ammar Babikir, Michael A. Henning:
Domination versus total domination in claw-free cubic graphs. Discret. Math. 345(4): 112784 (2022) - [j384]Michael A. Henning, Saikat Pal, Dinabandhu Pradhan:
The semitotal domination problem in block graphs. Discuss. Math. Graph Theory 42(1): 231-248 (2022) - [j383]Majid Hajian, Michael A. Henning, Nader Jafari Rad:
A classification of cactus graphs according to their domination number. Discuss. Math. Graph Theory 42(2): 613-626 (2022) - [j382]Michael A. Henning:
Bounds on domination parameters in graphs: a brief survey. Discuss. Math. Graph Theory 42(3): 665-708 (2022) - [j381]Ammar Babikir, Michael A. Henning:
Triangles and (Total) Domination in Subcubic Graphs. Graphs Comb. 38(2): 28 (2022) - [j380]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): 50 (2022) - [j379]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): 75 (2022) - [j378]Aleksandra Gorzkowska, Michael A. Henning, Elzbieta Kleszcz, Monika Pilsniak:
Paired Domination in Trees. Graphs Comb. 38(4): 129 (2022) - [j377]Ammar Babikir, Michael A. Henning:
Upper Total Domination in Claw-Free Cubic Graphs. Graphs Comb. 38(6): 172 (2022) - [j376]Amirreza Akbari, Saieed Akbari, Ali Doosthosseini, Zahra Hadizadeh, Michael A. Henning, A. Naraghi:
Independent domination in subcubic graphs. J. Comb. Optim. 43(1): 28-41 (2022) - [j375]Michael A. Henning, Anders Yeo:
A complete description of convex sets associated with matchings and edge-connectivity in graphs. J. Graph Theory 101(4): 643-667 (2022) - [i5]Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret Wagler:
Progress towards the two-thirds conjecture on locating-total dominating sets. CoRR abs/2211.14178 (2022) - 2021
- [j374]S. Banerjee, Michael A. Henning, Dinabandhu Pradhan:
Perfect Italian domination in cographs. Appl. Math. Comput. 391: 125703 (2021) - [j373]Michael A. Henning, Pawaton Kaemawichanurat:
Connected domination critical graphs with a block having maximum number of cut vertices. Appl. Math. Comput. 406: 126248 (2021) - [j372]Michael A. Henning, Douglas F. Rall:
The enclaveless competition game. Ars Math. Contemp. 20(1): 129-142 (2021) - [j371]Michael A. Henning, Anders Yeo:
A new upper bound on the total domination number in graphs with minimum degree six. Discret. Appl. Math. 302: 1-7 (2021) - [j370]Michael A. Henning, Anders Yeo:
Lower bounds on Tuza constants for transversals in linear uniform hypergraphs. Discret. Appl. Math. 304: 12-22 (2021) - [j369]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): 112243 (2021) - [j368]Michael A. Henning, Zekhaya B. Shozi:
A characterization of graphs with given maximum degree and smallest possible matching number. Discret. Math. 344(7): 112426 (2021) - [j367]Michael A. Henning, Anders Yeo:
Matching and edge-connectivity in graphs with given maximum degree. Discret. Math. 344(8): 112438 (2021) - [j366]Csilla Bujtás, Michael A. Henning:
On the domination number of graphs with minimum degree six. Discret. Math. 344(8): 112449 (2021) - [j365]Mohammadhossein Fakharan, Ali A. Gorzin, Michael A. Henning, Amir Jafari, Rouzbeh Tusserkani:
On (1, 2)-domination in cubic graphs. Discret. Math. 344(10): 112546 (2021) - [j364]Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
Restrained domination in self-complementary graphs. Discuss. Math. Graph Theory 41(2): 633-645 (2021) - [j363]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): 749-762 (2021) - [j362]Michael A. Henning, Jerzy Topp:
Minimal graphs with disjoint dominating and paired-dominating sets. Discuss. Math. Graph Theory 41(3): 827-847 (2021) - [j361]Michael A. Henning, Arti Pandey, Vikash Tripathi:
Semipaired Domination in Some Subclasses of Chordal Graphs. Discret. Math. Theor. Comput. Sci. 23(1) (2021) - [j360]Michael A. Henning, Nader Jafari Rad:
Upper Bounds on the k-Tuple (Roman) Domination Number of a Graph. Graphs Comb. 37(1): 325-336 (2021) - [j359]Ammar Babikir, Magda Dettlaff, Michael A. Henning, Magdalena Lemanska:
Independent Domination Subdivision in Graphs. Graphs Comb. 37(3): 691-709 (2021) - [j358]Michael A. Henning, Anders Yeo:
Affine Planes and Transversals in 3-Uniform Linear Hypergraphs. Graphs Comb. 37(3): 867-890 (2021) - [j357]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): 451-486 (2021) - [j356]Randy Davila, Michael A. Henning:
Zero forcing versus domination in cubic graphs. J. Comb. Optim. 41(2): 553-577 (2021) - [j355]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): 455-471 (2021) - [c2]Michael A. Henning, Arti Pandey, Vikash Tripathi:
Approximation Algorithm and Hardness Results for Defensive Domination in Graphs. COCOA 2021: 247-261 - 2020
- [j354]Wayne Goddard, Michael A. Henning:
Independent domination, colorings and the fractional idomatic number of a graph. Appl. Math. Comput. 382: 125340 (2020) - [j353]Michael A. Henning, Nawarat Ananchuen, Pawaton Kaemawichanurat:
Traceability of connected domination critical graphs. Appl. Math. Comput. 386: 125455 (2020) - [j352]Valentin Gledel, Michael A. Henning, Vesna Irsic, Sandi Klavzar:
Maker-Breaker total domination game. Discret. Appl. Math. 282: 96-107 (2020) - [j351]Robert A. Beeler, Teresa W. Haynes, Michael A. Henning, Rodney Keaton:
Total domination cover rubbling. Discret. Appl. Math. 283: 133-141 (2020) - [j350]Bostjan Bresar, Michael A. Henning:
A 34-approximation of Vizing's conjecture for claw-free graphs. Discret. Appl. Math. 284: 416-422 (2020) - [j349]Julien Baste, Maximilian Fürst, Michael A. Henning, Elena Mohr, Dieter Rautenbach:
Domination versus edge domination. Discret. Appl. Math. 285: 343-349 (2020) - [j348]Michael A. Henning, Gary MacGillivray, Frank Yang:
2-limited broadcast domination in subcubic graphs. Discret. Appl. Math. 285: 691-706 (2020) - [j347]Ammar Babikir, Michael A. Henning:
Domination versus independent domination in graphs of small regularity. Discret. Math. 343(7): 111727 (2020) - [j346]Randy Davila, Michael A. Henning:
Total forcing sets and zero forcing sets in trees. Discuss. Math. Graph Theory 40(3): 733-754 (2020) - [j345]Maximilian Fürst, Michael Gentner, Michael A. Henning, Simon Jäger, Dieter Rautenbach:
Equating k maximum degrees in graphs without short cycles. Discuss. Math. Graph Theory 40(3): 841-853 (2020) - [j344]Teresa W. Haynes, Michael A. Henning:
Trees with Unique Minimum Semitotal Dominating Sets. Graphs Comb. 36(3): 689-702 (2020) - [j343]Michael A. Henning, Saikat Pal, Dinabandhu Pradhan:
Algorithm and hardness results on hop domination in graphs. Inf. Process. Lett. 153 (2020) - [j342]Michael A. Henning, Anders Yeo:
Bounds on upper transversals in hypergraphs. J. Comb. Optim. 39(1): 77-89 (2020) - [j341]S. Banerjee, Michael A. Henning, Dinabandhu Pradhan:
Algorithmic results on double Roman domination in graphs. J. Comb. Optim. 39(1): 90-114 (2020) - [j340]Michael A. Henning, Arti Pandey, Vikash Tripathi:
Complexity and Algorithms for Semipaired Domination in Graphs. Theory Comput. Syst. 64(7): 1225-1241 (2020) - [j339]Michael A. Henning, Dinabandhu Pradhan:
Algorithmic aspects of upper paired-domination in graphs. Theor. Comput. Sci. 804: 98-114 (2020) - [i4]Amirreza Akbari, Saieed Akbari, Ali Doosthosseini, Zahra Hadizadeh, Michael A. Henning, A. Naraghi:
Independent Domination in Subcubic Graphs. CoRR abs/2001.02946 (2020) - [i3]Michael A. Henning, Arti Pandey, Vikash Tripathi:
Semipaired Domination in Some Subclasses of Chordal Graphs. CoRR abs/2008.13491 (2020)
2010 – 2019
- 2019
- [j338]Randy Davila, Michael A. Henning:
Total forcing versus total domination in cubic graphs. Appl. Math. Comput. 354: 385-395 (2019) - [j337]Michael A. Henning, Iztok Peterin:
A characterization of graphs with disjoint total dominating sets. Ars Math. Contemp. 16(2): 359-375 (2019) - [j336]Randy Davila, Michael A. Henning:
On the total forcing number of a graph. Discret. Appl. Math. 257: 115-127 (2019) - [j335]Michael A. Henning, Nader Jafari Rad:
A characterization of double Roman trees. Discret. Appl. Math. 259: 100-111 (2019) - [j334]Teresa W. Haynes, Michael A. Henning:
Perfect Italian domination in trees. Discret. Appl. Math. 260: 164-177 (2019) - [j333]Maximilian Fürst, Michael A. Henning, Dieter Rautenbach:
Uniquely restricted matchings in subcubic graphs. Discret. Appl. Math. 262: 189-194 (2019) - [j332]Paul Dorbec, Michael A. Henning, Sandi Klavzar, Gasper Kosmrlj:
Cutting lemma and union lemma for the domination game. Discret. Math. 342(4): 1213-1222 (2019) - [j331]Michael A. Henning, Nader Jafari Rad:
A note on improved upper bounds on the transversal number of hypergraphs. Discret. Math. Algorithms Appl. 11(1): 1950004:1-1950004:6 (2019) - [j330]Joanna Cyman, Michael A. Henning, Jerzy Topp:
On accurate domination in graphs. Discuss. Math. Graph Theory 39(3): 615-627 (2019) - [j329]Teresa W. Haynes, Michael A. Henning:
Graphs with large semipared domination number. Discuss. Math. Graph Theory 39(3): 659-671 (2019) - [j328]Gholamreza Abrishami, Michael A. Henning, Freydoon Rahbarnia:
On independent domination in planar, cubic graphs. Discuss. Math. Graph Theory 39(4): 841-853 (2019) - [j327]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) - [j326]Michael A. Henning, Anders Yeo:
Upper transversals in hypergraphs. Eur. J. Comb. 78: 1-12 (2019) - [j325]Christoph Brause, Michael A. Henning:
Independent Domination in Bipartite Cubic Graphs. Graphs Comb. 35(4): 881-912 (2019) - [j324]Majid Hajian, Michael A. Henning, Nader Jafari Rad:
A new lower bound on the domination number of a graph. J. Comb. Optim. 38(3): 721-738 (2019) - [j323]Michael A. Henning, Pawaton Kaemawichanurat:
Semipaired domination in maximal outerplanar graphs. J. Comb. Optim. 38(3): 911-926 (2019) - [j322]Michael A. Henning, Arti Pandey:
Algorithmic aspects of semitotal domination in graphs. Theor. Comput. Sci. 766: 46-57 (2019) - [c1]Michael A. Henning, Arti Pandey, Vikash Tripathi:
Complexity and Algorithms for Semipaired Domination in Graphs. IWOCA 2019: 278-289 - [i2]Michael A. Henning, Arti Pandey, Vikash Tripathi:
Complexity and Algorithms for Semipaired Domination in Graphs. CoRR abs/1904.00964 (2019) - 2018
- [j321]Wyatt J. Desormeaux, Michael A. Henning:
A New Lower Bound on the Total Domination Number of a Tree. Ars Comb. 138: 305-322 (2018) - [j320]Michael A. Henning, Anders Yeo:
On Upper Transversals in 3-Uniform Hypergraphs. Electron. J. Comb. 25(4): 4 (2018) - [j319]Christoph Brause, Michael A. Henning, Kenta Ozeki, Ingo Schiermeyer, Elkin Vumar:
On upper bounds for the independent transversal domination number. Discret. Appl. Math. 236: 66-72 (2018) - [j318]Michael A. Henning, William F. Klostermeyer, Gary MacGillivray:
Perfect Roman domination in trees. Discret. Appl. Math. 236: 235-245 (2018) - [j317]Michael A. Henning, Marcin Krzywkowski:
Total domination stability in graphs. Discret. Appl. Math. 236: 246-255 (2018) - [j316]Wayne Goddard, Michael A. Henning:
The matcher game played in graphs. Discret. Appl. Math. 237: 82-88 (2018) - [j315]Michael A. Henning:
Essential upper bounds on the total domination number. Discret. Appl. Math. 244: 103-115 (2018) - [j314]Michael A. Henning, Sandi Klavzar, Douglas F. Rall:
Game total domination critical graphs. Discret. Appl. Math. 250: 28-37 (2018) - [j313]Michael A. Henning, Gary MacGillivray, Frank Yang:
k-broadcast domination and k-multipacking. Discret. Appl. Math. 250: 241-251 (2018) - [j312]Gholamreza Abrishami, Michael A. Henning:
Independent domination in subcubic graphs of girth at least six. Discret. Math. 341(1): 155-164 (2018) - [j311]Michael A. Henning, Anders Yeo:
Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs. Discret. Math. 341(8): 2285-2292 (2018) - [j310]Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
Domination parameters of a graph and its complement. Discuss. Math. Graph Theory 38(1): 203-215 (2018) - [j309]Michael A. Henning, Simon Jäger, Dieter Rautenbach:
Hereditary equality of domination and exponential domination. Discuss. Math. Graph Theory 38(1): 275-285 (2018) - [j308]Joanna Cyman, Magda Dettlaff, Michael A. Henning, Magdalena Lemanska, Joanna Raczek:
Total domination in versus paired-domination in regular graphs. Discuss. Math. Graph Theory 38(2): 573-586 (2018) - [j307]Joanna Cyman, Magda Dettlaff, Michael A. Henning, Magdalena Lemanska, Joanna Raczek:
Total Domination Versus Domination in Cubic Graphs. Graphs Comb. 34(1): 261-276 (2018) - [j306]Michael A. Henning, Pawaton Kaemawichanurat:
Semipaired Domination in Claw-Free Cubic Graphs. Graphs Comb. 34(4): 819-844 (2018) - [j305]Randy Davila, Michael A. Henning, Colton Magnant, Ryan Pepper:
Bounds on the Connected Forcing Number of a Graph. Graphs Comb. 34(6): 1159-1174 (2018) - [j304]Randy Davila, Michael A. Henning:
Total Forcing and Zero Forcing in Claw-Free Cubic Graphs. Graphs Comb. 34(6): 1371-1384 (2018) - [j303]Wayne Goddard, Michael A. Henning:
A note on domination and total domination in prisms. J. Comb. Optim. 35(1): 14-20 (2018) - [j302]Teresa W. Haynes, Michael A. Henning:
Perfect graphs involving semitotal and semipaired domination. J. Comb. Optim. 36(2): 416-433 (2018) - [j301]Michael Gentner, Michael A. Henning, Dieter Rautenbach:
Smallest domination number and largest independence number of graphs and forests with given degree sequence. J. Graph Theory 88(1): 131-145 (2018) - [j300]Wayne Goddard, Michael A. Henning:
Thoroughly dispersed colorings. J. Graph Theory 88(1): 174-191 (2018) - [j299]Michael A. Henning, Anders Yeo:
Tight lower bounds on the matching number in a graph with given maximum degree. J. Graph Theory 89(2): 115-149 (2018) - [j298]Laurent Beaudou, Peter Dankelmann, Florent Foucaud, Michael A. Henning, Arnaud Mary, Aline Parreau:
Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension. SIAM J. Discret. Math. 32(2): 902-918 (2018) - 2017
- [j297]Randy Davila, Caleb Fast, Michael A. Henning, Franklin Kenter:
Lower Bounds on the Distance Domination Number of a Graph. Contributions Discret. Math. 12(2) (2017) - [j296]Michael A. Henning, William Klostermeyer, Gary MacGillivray:
Bounds for the $m$-Eternal Domination Number of a Graph. Contributions Discret. Math. 12(2) (2017) - [j295]Michael A. Henning, Sandi Klavzar, Douglas F. Rall:
The 4/5 upper bound on the game total domination number. Comb. 37(2): 223-251 (2017) - [j294]Jernej Azarija, Michael A. Henning, Sandi Klavzar:
(Total) Domination in Prisms. Electron. J. Comb. 24(1): 1 (2017) - [j293]Michael A. Henning, Anders Yeo:
Transversals and Independence in Linear Hypergraphs with Maximum Degree Two. Electron. J. Comb. 24(2): 2 (2017) - [j292]Michael A. Henning, William F. Klostermeyer:
Italian domination in trees. Discret. Appl. Math. 217: 557-564 (2017) - [j291]Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
Partitioning the vertices of a cubic graph into two total dominating sets. Discret. Appl. Math. 223: 52-63 (2017) - [j290]Michael A. Henning, Douglas F. Rall:
Trees with equal total domination and game total domination numbers. Discret. Appl. Math. 226: 58-70 (2017) - [j289]Michael A. Henning, Simon Jäger, Dieter Rautenbach:
Relating domination, exponential domination, and porous exponential domination. Discret. Optim. 23: 81-92 (2017) - [j288]Florent Foucaud, Michael A. Henning:
Location-domination in line graphs. Discret. Math. 340(1): 3140-3153 (2017) - [j287]Michael A. Henning, Kirsti Wash:
Matchings, path covers and domination. Discret. Math. 340(1): 3207-3216 (2017) - [j286]Michael A. Henning, Anders Yeo:
A note on fractional disjoint transversals in hypergraphs. Discret. Math. 340(10): 2349-2354 (2017) - [j285]Michael A. Henning, Christian Löwenstein:
Domination game: extremal families for 3/5-conjecture for forests. Discuss. Math. Graph Theory 37(2): 369-381 (2017) - [j284]Christoph Brause, Michael A. Henning, Marcin Krzywkowski:
A characterization of trees with equal 2-domination and 2-independence numbers. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [j283]Csilla Bujtás, Michael A. Henning, Zsolt Tuza:
Bounds on the game transversal number in hypergraphs. Eur. J. Comb. 59: 34-50 (2017) - [j282]Michael A. Henning:
Edge Weighting Functions on Semitotal Dominating Sets. Graphs Comb. 33(2): 403-417 (2017) - [j281]Michael A. Henning, Nader Jafari Rad:
On 2-Step and Hop Dominating Sets in Graphs. Graphs Comb. 33(4): 913-927 (2017) - [j280]Bostjan Bresar, Michael A. Henning:
The game total domination problem is log-complete in PSPACE. Inf. Process. Lett. 126: 12-17 (2017) - [j279]Michael A. Henning, Nicolas Lichiardopol:
Distance domination in graphs with given minimum and maximum degree. J. Comb. Optim. 34(2): 545-553 (2017) - [i1]Michael A. Henning, Arti Pandey:
Algorithmic Aspects of Semitotal Domination in Graphs. CoRR abs/1711.10891 (2017) - 2016
- [j278]Florent Foucaud, Michael A. Henning:
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture. Electron. J. Comb. 23(3): 3 (2016) - [j277]Michael A. Henning, Anders Yeo:
Transversals in 4-Uniform Hypergraphs. Electron. J. Comb. 23(3): 3 (2016) - [j276]Florent Foucaud, Michael A. Henning, Christian Löwenstein, Thomas Sasse:
Locating-dominating sets in twin-free graphs. Discret. Appl. Math. 200: 52-58 (2016) - [j275]Michael A. Henning, Felix Joos, Christian Löwenstein, Dieter Rautenbach:
Induced 2-regular subgraphs in k-chordal cubic graphs. Discret. Appl. Math. 205: 73-79 (2016) - [j274]Michael Gentner, Michael A. Henning, Dieter Rautenbach:
Largest domination number and smallest independence number of forests with given degree sequence. Discret. Appl. Math. 206: 181-187 (2016) - [j273]Paul Dorbec, Michael A. Henning:
Game total domination for cycles and paths. Discret. Appl. Math. 208: 7-18 (2016) - [j272]Michael A. Henning, William F. Klostermeyer:
Trees with large m-eternal domination number. Discret. Appl. Math. 211: 79-85 (2016) - [j271]Alex Eustis, Michael A. Henning, Anders Yeo:
Independence in 5-uniform hypergraphs. Discret. Math. 339(2): 1004-1027 (2016) - [j270]Florent Foucaud, Michael A. Henning:
Location-domination and matching in cubic graphs. Discret. Math. 339(4): 1221-1231 (2016) - [j269]Bostjan Bresar, Michael A. Henning, Douglas F. Rall:
Total dominating sequences in graphs. Discret. Math. 339(6): 1665-1676 (2016) - [j268]Michael A. Henning, Douglas F. Rall:
Progress towards the total domination game -conjecture. Discret. Math. 339(11): 2620-2627 (2016) - [j267]Michael A. Henning, Alister J. Marcon:
Vertices contained in all or in no minimum semitotal dominating set of a tree. Discuss. Math. Graph Theory 36(1): 71-93 (2016) - [j266]Michael A. Henning, Viroshan Naicker:
Bounds on the disjunctive total domination number of a tree. Discuss. Math. Graph Theory 36(1): 153-171 (2016) - [j265]Michael A. Henning, Christian Löwenstein:
A characterization of hypergraphs with large domination number. Discuss. Math. Graph Theory 36(2): 427-438 (2016) - [j264]Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
A note on non-dominating set partitions in graphs. Discuss. Math. Graph Theory 36(4): 1043-1050 (2016) - [j263]Michael A. Henning, Lutz Volkmann:
Signed Roman k-Domination in Graphs. Graphs Comb. 32(1): 175-190 (2016) - [j262]Michael A. Henning, Felix Joos, Christian Löwenstein, Thomas Sasse:
Induced Cycles in Graphs. Graphs Comb. 32(6): 2425-2441 (2016) - [j261]Wyatt J. Desormeaux, Michael A. Henning:
Lower bounds on the total domination number of a graph. J. Comb. Optim. 31(1): 52-66 (2016) - [j260]Michael A. Henning, Viroshan Naicker:
Disjunctive total domination in graphs. J. Comb. Optim. 31(3): 1090-1110 (2016) - [j259]Michael A. Henning, Christian Löwenstein:
The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3. J. Graph Theory 83(2): 196-208 (2016) - [j258]Michael A. Henning, William B. Kinnersley:
Domination Game: A proof of the 3/5-Conjecture for Graphs with Minimum Degree at Least Two. SIAM J. Discret. Math. 30(1): 20-35 (2016) - [j257]Csilla Bujtás, Michael A. Henning, Zsolt Tuza:
Transversal Game on Hypergraphs and the 3/4-Conjecture on the Total Domination Game. SIAM J. Discret. Math. 30(3): 1830-1847 (2016) - 2015
- [j256]Michael A. Henning, Sinclair A. Marcon:
Domination versus disjunctive domination in trees. Discret. Appl. Math. 184: 171-177 (2015) - [j255]Michael A. Henning, Lutz Volkmann:
Signed Roman k-domination in trees. Discret. Appl. Math. 186: 98-105 (2015) - [j254]Michael A. Henning, Justin Southey:
A characterization of the non-trivial diameter two graphs of minimum size. Discret. Appl. Math. 187: 91-95 (2015) - [j253]Michael A. Henning, Kirsti Wash:
Trees with large neighborhood total domination number. Discret. Appl. Math. 187: 96-102 (2015) - [j252]Michael Anthony Henning, Viroshan Naicker:
Graphs with Large Disjunctive Total Domination Number. Discret. Math. Theor. Comput. Sci. 17(1): 255-282 (2015) - [j251]Michael A. Henning:
Total Dominator Colorings and Total Domination in Graphs. Graphs Comb. 31(4): 953-974 (2015) - [j250]Camino Balbuena, Adriana Hansberg, Teresa W. Haynes, Michael A. Henning:
Total Domination Edge Critical Graphs with Total Domination Number Three and Many Dominating Pairs. Graphs Comb. 31(5): 1163-1176 (2015) - [j249]Michael A. Henning, Sandi Klavzar, Douglas F. Rall:
Total Version of the Domination Game. Graphs Comb. 31(5): 1453-1462 (2015) - [j248]Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe, Anders Yeo:
Progress on the Murty-Simon Conjecture on diameter-2 critical graphs: a survey. J. Comb. Optim. 30(3): 579-595 (2015) - [j247]Michael A. Henning, Anders Yeo:
On 2-Colorings of Hypergraphs. J. Graph Theory 80(2): 112-135 (2015) - [j246]Paul Dorbec, Michael A. Henning, Mickaël Montassier, Justin Southey:
Independent Domination in Cubic Graphs. J. Graph Theory 80(4): 329-349 (2015) - [j245]Michael A. Henning, Anders Yeo:
Total Transversals in Hypergraphs and Their Applications. SIAM J. Discret. Math. 29(1): 309-320 (2015) - 2014
- [j244]Michael A. Henning, Christian Löwenstein, Justin Southey, Anders Yeo:
A New Lower Bound on the Independence Number of a Graph and Applications. Electron. J. Comb. 21(1): 1 (2014) - [j243]Csilla Bujtás, Michael A. Henning, Zsolt Tuza, Anders Yeo:
Total Transversals and Total Domination in Uniform Hypergraphs. Electron. J. Comb. 21(2): 2 (2014) - [j242]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
Independent domination in subcubic bipartite graphs of girth at least six. Discret. Appl. Math. 162: 399-403 (2014) - [j241]Teresa W. Haynes, Michael A. Henning:
A characterization of P5-free, diameter-2-critical graphs. Discret. Appl. Math. 169: 135-139 (2014) - [j240]Michael A. Henning, John McCoy, Justin Southey:
Graphs with maximum size and given paired-domination number. Discret. Appl. Math. 170: 72-82 (2014) - [j239]Michael A. Henning, Anders Yeo:
A new lower bound for the total domination number in graphs proving a Graffiti.pc Conjecture. Discret. Appl. Math. 173: 45-52 (2014) - [j238]Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
Improved bounds on the domination number of a tree. Discret. Appl. Math. 177: 88-94 (2014) - [j237]Michael A. Henning, Christian Löwenstein:
An improved lower bound on the independence number of a graph. Discret. Appl. Math. 179: 120-128 (2014) - [j236]Michael A. Henning, Dieter Rautenbach:
Induced matchings in subcubic graphs without short cycles. Discret. Math. 315-316: 165-172 (2014) - [j235]Wyatt J. Desormeaux, Michael A. Henning, Douglas F. Rall, Anders Yeo:
Relating the annihilation number and the 2-domination number of a tree. Discret. Math. 319: 15-23 (2014) - [j234]Michael A. Henning, Christian Löwenstein:
A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid Theorem. Discret. Math. 323: 69-75 (2014) - [j233]Michael A. Henning, Alister J. Marcon:
On matching and semitotal domination in graphs. Discret. Math. 324: 13-18 (2014) - [j232]Michael Dorfling, Michael A. Henning:
Linear hypergraphs with large transversal number and maximum degree two. Eur. J. Comb. 36: 231-236 (2014) - [j231]Michael A. Henning, Anders Yeo:
Distinguishing-Transversal in Hypergraphs and Identifying Open Codes in Cubic Graphs. Graphs Comb. 30(4): 909-932 (2014) - [j230]Yair Caro, Michael A. Henning:
Simultaneous Domination in Graphs. Graphs Comb. 30(6): 1399-1416 (2014) - [j229]Hossein Abdollahzadeh Ahangar, Michael A. Henning, Christian Löwenstein, Yancai Zhao, Vladimir Samodivkin:
Signed Roman domination in graphs. J. Comb. Optim. 27(2): 241-255 (2014) - [j228]Paul Dorbec, Bert L. Hartnell, Michael A. Henning:
Paired versus double domination in K 1, r -free graphs. J. Comb. Optim. 27(4): 688-694 (2014) - [j227]Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning, Anders Yeo:
Total Domination in Graphs with Diameter 2. J. Graph Theory 75(1): 91-103 (2014) - 2013
- [j226]Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
Relating the annihilation number and the total domination number of a tree. Discret. Appl. Math. 161(3): 349-354 (2013) - [j225]Michael A. Henning, Ernst J. Joubert:
Equality in a linear Vizing-like relation that relates the size and total domination number of a graph. Discret. Appl. Math. 161(13-14): 2014-2024 (2013) - [j224]Michael A. Henning, Nader Jafari Rad:
Bounds on neighborhood total domination in graphs. Discret. Appl. Math. 161(16-17): 2460-2466 (2013) - [j223]Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
Bounds on the connected domination number of a graph. Discret. Appl. Math. 161(18): 2925-2931 (2013) - [j222]Michael A. Henning, Anders Yeo:
Total domination and matching numbers in graphs with all vertices in triangles. Discret. Math. 313(2): 174-181 (2013) - [j221]Wayne Goddard, Michael A. Henning:
Independent domination in graphs: A survey and recent results. Discret. Math. 313(7): 839-854 (2013) - [j220]Michael A. Henning, Anders Yeo:
Hypergraphs with large transversal number. Discret. Math. 313(8): 959-966 (2013) - [j219]Michael A. Henning, Dieter Rautenbach, Philipp Matthias Schäfer:
Open packing, total domination, and the P3-Radon number. Discret. Math. 313(9): 992-998 (2013) - [j218]Justin Southey, Michael A. Henning:
Domination versus independent domination in cubic graphs. Discret. Math. 313(11): 1212-1220 (2013) - [j217]Michael A. Henning, Douglas F. Rall:
On graphs with disjoint dominating and 2-dominating sets. Discuss. Math. Graph Theory 33(1): 139-146 (2013) - [j216]Michael A. Henning, Anders Yeo:
Transversals and matchings in 3-uniform hypergraphs. Eur. J. Comb. 34(2): 217-228 (2013) - [j215]Michael A. Henning, Anders Yeo:
22-colorings in kk-regular kk-uniform hypergraphs. Eur. J. Comb. 34(7): 1192-1202 (2013) - [j214]Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
Edge lifting and total domination in graphs. J. Comb. Optim. 25(1): 47-59 (2013) - [j213]Michael A. Henning, Anders Yeo:
Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three. J. Graph Theory 72(2): 220-245 (2013) - [j212]Justin Southey, Michael A. Henning:
Edge Weighting Functions on Dominating Sets. J. Graph Theory 72(3): 346-360 (2013) - [j211]Paul Dorbec, Michael A. Henning, Christian Löwenstein, Mickaël Montassier, André Raspaud:
Generalized Power Domination in Regular Graphs. SIAM J. Discret. Math. 27(3): 1559-1574 (2013) - 2012
- [j210]Michael A. Henning, Anders Yeo:
Identifying Vertex Covers in Graphs. Electron. J. Comb. 19(4): 32 (2012) - [j209]Michael A. Henning, Adel P. Kazemi:
Total domination in inflated graphs. Discret. Appl. Math. 160(1-2): 164-169 (2012) - [j208]Yair Caro, Michael A. Henning:
Directed domination in oriented graphs. Discret. Appl. Math. 160(7-8): 1053-1063 (2012) - [j207]Michael A. Henning, Ernst J. Joubert, Justin Southey:
Multiple factor Nordhaus-Gaddum type results for domination and total domination. Discret. Appl. Math. 160(7-8): 1137-1142 (2012) - [j206]Michael A. Henning, Nader Jafari Rad:
On α-total domination in graphs. Discret. Appl. Math. 160(7-8): 1143-1151 (2012) - [j205]Michael A. Henning, Christian Löwenstein:
Hypergraphs with large domination number and with edge sizes at least three. Discret. Appl. Math. 160(12): 1757-1765 (2012) - [j204]Teresa W. Haynes, Michael A. Henning:
A characterization of diameter-2-critical graphs whose complements are diamond-free. Discret. Appl. Math. 160(13-14): 1979-1985 (2012) - [j203]Michael A. Henning, Nader Jafari Rad:
Locating-total domination in graphs. Discret. Appl. Math. 160(13-14): 1986-1993 (2012) - [j202]Teresa W. Haynes, Michael A. Henning, Anders Yeo:
On a conjecture of Murty and Simon on diameter two critical graphs II. Discret. Math. 312(2): 315-323 (2012) - [j201]Michael A. Henning, Lucas C. van der Merwe:
The maximum diameter of total domination edge-critical graphs. Discret. Math. 312(2): 397-404 (2012) - [j200]Abdollah Alimadadi, Changiz Eslahchi, Teresa W. Haynes, Michael A. Henning, Nader Jafari Rad, Lucas C. van der Merwe:
Erratum to "Total domination supercritical graphs with respect to relative complements" [Discrete Math. 258 (2002) 361-371]. Discret. Math. 312(5): 1076 (2012) - [j199]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
Independent sets and matchings in subcubic graphs. Discret. Math. 312(11): 1900-1910 (2012) - [j198]Yair Caro, Adriana Hansberg, Michael A. Henning:
Fair domination in graphs. Discret. Math. 312(19): 2905-2914 (2012) - [j197]Michael A. Henning, Christian Löwenstein:
Locating-total domination in claw-free cubic graphs. Discret. Math. 312(21): 3107-3116 (2012) - [j196]Csilla Bujtás, Michael A. Henning, Zsolt Tuza:
Transversals and domination in uniform hypergraphs. Eur. J. Comb. 33(1): 62-72 (2012) - [j195]Michael A. Henning, Anders Yeo:
Girth and Total Domination in Graphs. Graphs Comb. 28(2): 199-214 (2012) - [j194]Justin Southey, Michael A. Henning:
An Improved Upper Bound on the Total Restrained Domination Number in Cubic Graphs. Graphs Comb. 28(4): 547-554 (2012) - [j193]Michael A. Henning, Adel P. Kazemi:
k-tuple total domination in cross products of graphs. J. Comb. Optim. 24(3): 339-346 (2012) - [j192]Bostjan Bresar, Paul Dorbec, Wayne Goddard, Bert L. Hartnell, Michael A. Henning, Sandi Klavzar, Douglas F. Rall:
Vizing's conjecture: a survey and recent results. J. Graph Theory 69(1): 46-76 (2012) - [j191]Michael A. Henning, Anders Yeo:
Vertex Disjoint Cycles of Different Length in Digraphs. SIAM J. Discret. Math. 26(2): 687-694 (2012) - 2011
- [j190]Michael A. Henning, Ernst J. Joubert, Justin Southey:
Nordhaus-Gaddum bounds for total domination. Appl. Math. Lett. 24(6): 987-990 (2011) - [j189]Ermelinda DeLaViña, Wayne Goddard, Michael A. Henning, Ryan Pepper, Emil R. Vaughan:
Bounds on the k-domination number of a graph. Appl. Math. Lett. 24(6): 996-998 (2011) - [j188]Frank Bullock, Peter Dankelmann, Marietjie Frick, Michael A. Henning, Ortrud R. Oellermann, Susan A. van Aardt:
Hamiltonicity of k-Traceable Graphs. Electron. J. Comb. 18(1) (2011) - [j187]Michael A. Henning, Ingo Schiermeyer, Anders Yeo:
A New Bound on the Domination Number of Graphs with Minimum Degree Two. Electron. J. Comb. 18(1) (2011) - [j186]Michael A. Henning, Nader Jafari Rad:
Total domination dot-critical graphs. Discret. Appl. Math. 159(2-3): 104-111 (2011) - [j185]Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
An extremal problem for total domination stable graphs upon edge removal. Discret. Appl. Math. 159(10): 1048-1052 (2011) - [j184]Michael A. Henning, Nader Jafari Rad, Joanna Raczek:
A note on total reinforcement in graphs. Discret. Appl. Math. 159(14): 1443-1446 (2011) - [j183]Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
Total domination changing and stable graphs upon vertex removal. Discret. Appl. Math. 159(15): 1548-1554 (2011) - [j182]Yair Caro, Michael A. Henning:
A Greedy Partition Lemma for directed domination. Discret. Optim. 8(3): 452-458 (2011) - [j181]Teresa W. Haynes, Michael A. Henning, Anders Yeo:
A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free. Discret. Optim. 8(3): 495-501 (2011) - [j180]Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe, Anders Yeo:
On the existence of k-partite or Kp-free total domination edge-critical graphs. Discret. Math. 311(13): 1142-1149 (2011) - [j179]S. Arumugam, Teresa W. Haynes, Michael A. Henning, Yared Nigussie:
Maximal independent sets in minimum colorings. Discret. Math. 311(13): 1158-1163 (2011) - [j178]Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe, Anders Yeo:
On a conjecture of Murty and Simon on diameter 2-critical graphs. Discret. Math. 311(17): 1918-1924 (2011) - [j177]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
Dominating sets, packings, and the maximum degree. Discret. Math. 311(18-19): 2031-2036 (2011) - [j176]Michael A. Henning, Ernst J. Joubert, Justin Southey:
Nordhaus-Gaddum Type Results for Total Domination. Discret. Math. Theor. Comput. Sci. 13(3): 87-96 (2011) - [j175]Michael A. Henning, Anders Yeo:
Perfect Matchings in Total Domination Critical Graphs. Graphs Comb. 27(5): 685-701 (2011) - [j174]Michael A. Henning, John McCoy:
Which trees have a differentiating-paired dominating set? J. Comb. Optim. 22(1): 1-18 (2011) - [j173]Justin Southey, Michael A. Henning:
A characterization of graphs with disjoint dominating and paired-dominating sets. J. Comb. Optim. 22(2): 217-234 (2011) - [j172]Paul Dorbec, Michael A. Henning:
Upper paired-domination in claw-free graphs. J. Comb. Optim. 22(2): 235-251 (2011) - 2010
- [j171]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
An independent dominating set in the complement of a minimum dominating set of a tree. Appl. Math. Lett. 23(1): 79-81 (2010) - [j170]Michael A. Henning, Lucas C. van der Merwe:
Properties of total domination edge-critical graphs. Discret. Appl. Math. 158(2): 147-153 (2010) - [j169]Michael A. Henning, Adel P. Kazemi:
k-tuple total domination in graphs. Discret. Appl. Math. 158(9): 1006-1011 (2010) - [j168]Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
Total domination critical and stable graphs upon edge removal. Discret. Appl. Math. 158(15): 1587-1592 (2010) - [j167]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach, Justin Southey:
Disjoint dominating and total dominating sets in graphs. Discret. Appl. Math. 158(15): 1615-1623 (2010) - [j166]Michael A. Henning:
Erratum to: "Local edge domination critical graphs" [Discrete Mathematics 161 (1996) 175-184]. Discret. Math. 310(10-11): 1648 (2010) - [j165]Michael A. Henning:
An upper bound on the paired-domination number in terms of the number of edges in the graph. Discret. Math. 310(21): 2847-2857 (2010) - [j164]Justin Southey, Michael A. Henning:
On a conjecture on total domination in claw-free cubic graphs. Discret. Math. 310(21): 2984-2999 (2010) - [j163]Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
Total domination stable graphs upon edge addition. Discret. Math. 310(24): 3446-3454 (2010) - [j162]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
Partitioning a graph into a dominating set, a total dominating set, and something else. Discuss. Math. Graph Theory 30(4): 563-574 (2010) - [j161]Michael A. Henning:
A short proof of a result on a Vizing-like problem for integer total domination. J. Comb. Optim. 20(3): 321-323 (2010) - [j160]Michael A. Henning, Anders Yeo:
Strong Transversals in Hypergraphs and Double Total Domination in Graphs. SIAM J. Discret. Math. 24(4): 1336-1355 (2010)
2000 – 2009
- 2009
- [j159]Michael A. Henning:
Restricted total domination in graphs with minimum degree two. Ars Comb. 90 (2009) - [j158]Teresa W. Haynes, Michael A. Henning:
Upper Bounds on the Total Domination Number. Ars Comb. 91 (2009) - [j157]Michael A. Henning, Nader Jafari Rad:
On total domination vertex critical graphs of high connectivity. Discret. Appl. Math. 157(8): 1969-1973 (2009) - [j156]Michael A. Henning, Simon Mukwembi:
Domination, radius, and minimum degree. Discret. Appl. Math. 157(13): 2964-2968 (2009) - [j155]Johannes H. Hattingh, Michael A. Henning:
Bounds relating the weakly connected domination number to the total domination number and the matching number. Discret. Appl. Math. 157(14): 3086-3093 (2009) - [j154]John McCoy, Michael A. Henning:
Locating and paired-dominating sets in graphs. Discret. Appl. Math. 157(15): 3268-3280 (2009) - [j153]Michael A. Henning:
A survey of selected recent results on total domination in graphs. Discret. Math. 309(1): 32-63 (2009) - [j152]Allan Frendrup, Michael A. Henning, Bert Randerath, Preben D. Vestergaard:
An upper bound on the domination number of a graph with minimum degree 2. Discret. Math. 309(4): 639-646 (2009) - [j151]Alewyn P. Burger, Michael A. Henning, Jan H. van Vuuren:
On the ratios between packing and domination parameters of a graph. Discret. Math. 309(8): 2473-2478 (2009) - [j150]Teresa W. Haynes, Michael A. Henning, Ping Zhang:
A dedication to Professor Gary Chartrand. Discret. Math. 309(19): 5803-5805 (2009) - [j149]Teresa W. Haynes, Michael A. Henning, Ping Zhang:
A survey of stratified domination in graphs. Discret. Math. 309(19): 5806-5819 (2009) - [j148]Michael A. Henning, John McCoy:
Total domination in planar graphs of diameter two. Discret. Math. 309(21): 6181-6189 (2009) - [j147]Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
Remarks about disjoint dominating sets. Discret. Math. 309(23-24): 6451-6458 (2009) - [j146]Michael A. Henning, Morten Hegner Nielsen, Ortrud R. Oellermann:
Local Steiner convexity. Eur. J. Comb. 30(5): 1186-1193 (2009) - [j145]Wayne Goddard, Michael A. Henning:
A Characterization of Cubic Graphs with Paired-Domination Number Three-Fifths Their Order. Graphs Comb. 25(5): 675-692 (2009) - [j144]Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe:
Domination and total domination in complementary prisms. J. Comb. Optim. 18(1): 23-37 (2009) - [j143]Michael A. Henning, Anders Yeo:
Total domination in 2-connected graphs and in graphs with no induced 6-cycles. J. Graph Theory 60(1): 55-79 (2009) - 2008
- [j142]Michelle Edwards, Richard G. Gibson, Michael A. Henning, Christina M. Mynhardt:
Diameter of paired domination edge-critical graphs. Australas. J Comb. 40: 279-292 (2008) - [j141]Johannes H. Hattingh, Michael A. Henning:
Restrained Domination Excellent Trees. Ars Comb. 87 (2008) - [j140]Michael A. Henning, Justin Southey:
A note on graphs with disjoint dominating and total dominating sets. Ars Comb. 89 (2008) - [j139]Michael A. Henning, Jacob Elgin Maritz:
Total restrained domination in graphs with minimum degree two. Discret. Math. 308(10): 1909-1920 (2008) - [j138]Michael A. Henning, Liying Kang, Erfang Shan, Anders Yeo:
On matching and total domination in graphs. Discret. Math. 308(11): 2313-2318 (2008) - [j137]Odile Favaron, Michael A. Henning:
Total domination in claw-free graphs with minimum degree 2. Discret. Math. 308(15): 3213-3219 (2008) - [j136]Odile Favaron, Michael A. Henning:
Bounds on total domination in claw-free cubic graphs. Discret. Math. 308(16): 3491-3507 (2008) - [j135]Jochen Harant, Michael A. Henning, Dieter Rautenbach, Ingo Schiermeyer:
The independence number in graphs of maximum degree three. Discret. Math. 308(23): 5829-5833 (2008) - [j134]Michael A. Henning, Anders Yeo:
Total Domination in Graphs with Given Girth. Graphs Comb. 24(4): 333-348 (2008) - [j133]Paul Dorbec, Michael A. Henning, Douglas F. Rall:
On the upper total domination number of Cartesian products of graphs. J. Comb. Optim. 16(1): 68-80 (2008) - [j132]Allan Frendrup, Michael A. Henning, Preben D. Vestergaard:
Total domination in partitioned trees and partitioned graphs with minimum degree two. J. Glob. Optim. 41(3): 385-399 (2008) - [j131]Michael A. Henning, Anders Yeo:
Hypergraphs with large transversal number and with edge sizes at least 3. J. Graph Theory 59(4): 326-348 (2008) - 2007
- [j130]Michael A. Henning, Anders Yeo:
A New Upper Bound on the Total Domination Number of a Graph. Electron. J. Comb. 14(1) (2007) - [j129]Michael A. Henning, Preben D. Vestergaard:
Domination in partitioned graphs with minimum degree two. Discret. Math. 307(9-10): 1115-1135 (2007) - [j128]Michael A. Henning:
Restricted domination in graphs with minimum degree 2. Discret. Math. 307(11-12): 1356-1366 (2007) - [j127]Michael A. Henning, Dieter Rautenbach:
On the irregularity of bipartite graphs. Discret. Math. 307(11-12): 1467-1472 (2007) - [j126]Peter Dankelmann, David P. Day, Johannes H. Hattingh, Michael A. Henning, Lisa R. Markus, Henda C. Swart:
On equality in an upper bound for the restrained and total domination numbers of a graph. Discret. Math. 307(22): 2845-2852 (2007) - [j125]Michael A. Henning, Anders Yeo:
Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph. Graphs Comb. 23(6): 647-657 (2007) - [j124]Michael A. Henning:
Graphs with large paired-domination number. J. Comb. Optim. 13(1): 61-78 (2007) - [j123]Wayne Goddard, Michael A. Henning:
Restricted domination parameters in graphs. J. Comb. Optim. 13(4): 353-363 (2007) - [j122]Paul Dorbec, Sylvain Gravier, Michael A. Henning:
Paired-domination in generalized claw-free graphs. J. Comb. Optim. 14(1): 1-7 (2007) - [j121]Erfang Shan, Liying Kang, Michael A. Henning:
Erratum to: "A linear vizing-like relation relating the size and total domination number of a graph". J. Graph Theory 54(4): 350-353 (2007) - 2006
- [j120]Laura M. Harris, Johannes H. Hattingh, Michael A. Henning:
Total k-subdominating functions on graphs. Australas. J Comb. 35: 141-154 (2006) - [j119]Laura M. Harris, Johannes H. Hattingh, Michael A. Henning:
Algorithmic aspects of minus total k-subdomination in graphs. Australas. J Comb. 36: 101-112 (2006) - [j118]Michael Dorfling, Wayne Goddard, Michael A. Henning:
Domination in Planar Graphs with Small Diameter II. Ars Comb. 78 (2006) - [j117]David Atkins, Teresa W. Haynes, Michael A. Henning:
Placing monitoring devices in electric power networks modelled by block graphs. Ars Comb. 79 (2006) - [j116]Michael A. Henning:
On the signed total chromatic number of a graph. Ars Comb. 79 (2006) - [j115]Teresa W. Haynes, Michael A. Henning:
Private Domination Trees. Ars Comb. 80 (2006) - [j114]Michael A. Henning, Jacob Elgin Maritz:
Stratification and Domination in Prisms. Ars Comb. 81 (2006) - [j113]Michael A. Henning, Anders Yeo:
Total Domination and Matching Numbers in Claw-Free Graphs. Electron. J. Comb. 13(1) (2006) - [j112]Michael Dorfling, Michael A. Henning:
A note on power domination in grid graphs. Discret. Appl. Math. 154(6): 1023-1027 (2006) - [j111]Teresa W. Haynes, Michael A. Henning, Jamie Howard:
Locating and total dominating sets in trees. Discret. Appl. Math. 154(8): 1293-1300 (2006) - [j110]Peter Dankelmann, Michael A. Henning, Wayne Goddard, Renu C. Laskar:
Simultaneous graph parameters: Factor domination and factor total domination. Discret. Math. 306(18): 2229-2233 (2006) - [j109]Michael Dorfling, Wayne Goddard, Michael A. Henning, Christina M. Mynhardt:
Construction of trees and graphs with equal domination parameters. Discret. Math. 306(21): 2647-2654 (2006) - [j108]Laura M. Harris, Johannes H. Hattingh, Michael A. Henning:
Algorithmic aspects of total k-subdomination in graphs. Discuss. Math. Graph Theory 26(1): 5-18 (2006) - [j107]Peter Dankelmann, Johannes H. Hattingh, Michael A. Henning, Henda C. Swart:
Trees with Equal Domination and Restrained Domination Numbers. J. Glob. Optim. 34(4): 597-607 (2006) - 2005
- [j106]Teresa W. Haynes, Michael A. Henning, Peter J. Slater:
Trees with Equal Domination and Paired-domination Numbers. Ars Comb. 76 (2005) - [j105]Michael Dorfling, Wayne Goddard, Johannes H. Hattingh, Michael A. Henning:
Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets. Discret. Math. 300(1-3): 82-90 (2005) - [j104]Michael A. Henning, Jacob Elgin Maritz:
Stratification and domination in graphs with minimum degree two. Discret. Math. 301(2-3): 175-194 (2005) - [j103]Teresa W. Haynes, Michael A. Henning:
Trees with two disjoint minimum independent dominating sets. Discret. Math. 304(1-3): 69-78 (2005) - [j102]Robert C. Brigham, Teresa W. Haynes, Michael A. Henning, Douglas F. Rall:
Bicritical domination. Discret. Math. 305(1-3): 18-32 (2005) - [j101]Michael A. Henning:
Graphs with double domination numbers. Discuss. Math. Graph Theory 25(1-2): 13-28 (2005) - [j100]Jochen Harant, Michael A. Henning:
On Double Domination in Graphs. Discuss. Math. Graph Theory 25(1-2): 29-34 (2005) - [j99]Bostjan Bresar, Michael A. Henning, Douglas F. Rall:
Paired-domination of Cartesian products of graphs and rainbow domination. Electron. Notes Discret. Math. 22: 233-237 (2005) - [j98]Michael A. Henning, Douglas F. Rall:
On the Total Domination Number of Cartesian Products of Graphs. Graphs Comb. 21(1): 63-69 (2005) - [j97]Michael A. Henning, Michael D. Plummer:
Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree. J. Comb. Optim. 10(3): 283-294 (2005) - [j96]Wayne Goddard, Michael A. Henning:
Multiple vertex coverings by cliques. J. Graph Theory 48(2): 157-167 (2005) - [j95]Michael A. Henning:
A linear Vizing-like relation relating the size and total domination number of a graph. J. Graph Theory 49(4): 285-290 (2005) - 2004
- [j94]Erfang Shan, Liying Kang, Michael A. Henning:
A characterization of trees with equal total domination and paired-domination numbers. Australas. J Comb. 30: 31-40 (2004) - [j93]Gary Chartrand, Teresa W. Haynes, Michael A. Henning, Ping Zhang:
Detour Domination in Graphs. Ars Comb. 71 (2004) - [j92]Michael A. Henning:
Trees with equal average domination and independent domination numbers. Ars Comb. 71 (2004) - [j91]Michael A. Henning, Ortrud Oellermann:
Metric-Locating-Dominating Sets in Graphs. Ars Comb. 73 (2004) - [j90]Michael A. Henning, Ortrud Oellermann:
The average connectivity of a digraph. Discret. Appl. Math. 140(1-3): 143-153 (2004) - [j89]Michael A. Henning, Ortrud Oellermann:
On upper domination Ramsey numbers for graphs. Discret. Math. 274(1-3): 125-135 (2004) - [j88]Michael A. Henning:
Signed total domination in graphs. Discret. Math. 278(1-3): 109-125 (2004) - [j87]Teresa W. Haynes, Michael A. Henning, Lora Hopkins:
Total domination subdivision numbers of trees. Discret. Math. 286(3): 195-202 (2004) - [j86]Michael A. Henning, Jacob Elgin Maritz:
Stratification and domination in graphs II. Discret. Math. 286(3): 203-211 (2004) - [j85]Wayne Goddard, Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe:
The diameter of total domination vertex critical graphs. Discret. Math. 286(3): 255-261 (2004) - [j84]Michael A. Henning:
Restricted total domination in graphs. Discret. Math. 289(1-3): 25-44 (2004) - [j83]Teresa W. Haynes, Michael A. Henning, Lora Hopkins:
Total domination subdivision numbers of graphs. Discuss. Math. Graph Theory 24(3): 457-467 (2004) - [j82]Odile Favaron, Michael A. Henning:
Paired-Domination in Claw-Free Cubic Graphs. Graphs Comb. 20(4): 447-456 (2004) - 2003
- [j81]Sheng Bau, Michael A. Henning, Peter Dankelmann:
Average lower independence in trees and outerplanar graphs. Ars Comb. 69 (2003) - [j80]Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning:
Global Defensive Alliances in Graphs. Electron. J. Comb. 10 (2003) - [j79]Ernest J. Cockayne, Michael A. Henning, Christina M. Mynhardt:
Vertices contained in all or in no minimum total dominating set of a tree. Discret. Math. 260(1-3): 37-44 (2003) - [j78]Teresa W. Haynes, Michael A. Henning, Peter J. Slater:
Strong equality of domination parameters in trees. Discret. Math. 260(1-3): 77-87 (2003) - [j77]Sheng Bau, Michael A. Henning:
Matching transformation graphs of cubic bipartite plane graphs. Discret. Math. 262(1-3): 27-36 (2003) - [j76]Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Peter J. Slater:
H-forming sets in graphs. Discret. Math. 262(1-3): 159-169 (2003) - [j75]Michael A. Henning:
Total domination excellent trees. Discret. Math. 263(1-3): 93-104 (2003) - [j74]Michael A. Henning, Stephen T. Hedetniemi:
Defending the Roman Empire--A new strategy. Discret. Math. 266(1-3): 239-251 (2003) - [j73]Wayne Goddard, Michael A. Henning:
Nordhaus-Gaddum bounds for independent domination. Discret. Math. 268(1-3): 299-302 (2003) - [j72]Gary Chartrand, David Erwin, Michael A. Henning, Peter J. Slater, Ping Zhang:
Graphs of order n with locating-chromatic number n-1. Discret. Math. 269(1-3): 65-79 (2003) - [j71]Michael A. Henning:
Defending the Roman Empire from multiple attacks. Discret. Math. 271(1-3): 101-115 (2003) - [j70]Teresa W. Haynes, Michael A. Henning:
Changing and unchanging domination: a classification. Discret. Math. 272(1): 65-79 (2003) - [j69]Gary Chartrand, Teresa W. Haynes, Michael A. Henning, Ping Zhang:
Stratification and domination in graphs. Discret. Math. 272(2-3): 171-185 (2003) - [j68]Odile Favaron, Michael A. Henning:
Upper total domination in claw-free graphs. J. Graph Theory 44(2): 148-158 (2003) - [p1]Gary Chartrand, Ping Zhang, Teresa W. Haynes, Michael A. Henning, Fred R. McMorris, Robert C. Brigham:
Graphical Measurement. Handbook of Graph Theory 2003: 872-951 - 2002
- [j67]Teresa W. Haynes, Michael A. Henning:
Total domination good vertices in graphs. Australas. J Comb. 26: 305- (2002) - [j66]Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe:
Total domination critical graphs with respect to relative complements. Ars Comb. 64: 169- (2002) - [j65]Teresa W. Haynes, Michael A. Henning:
Trees with equal domination and tree-free domination numbers. Discret. Math. 242(1-3): 93-102 (2002) - [j64]Michael A. Henning, Ortrud Oellermann:
The upper domination Ramsey number u(3, 3, 3). Discret. Math. 242(1-3): 103-113 (2002) - [j63]Teresa W. Haynes, Michael A. Henning:
A characterization of i-excellent trees. Discret. Math. 248(1-3): 69-77 (2002) - [j62]Michael A. Henning:
Signed 2-independence in graphs. Discret. Math. 250(1-3): 93-107 (2002) - [j61]Michael A. Henning:
Restricted domination in graphs. Discret. Math. 254(1-3): 175-189 (2002) - [j60]Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley:
Total irredundance in graphs. Discret. Math. 256(1-2): 115-127 (2002) - [j59]Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe:
Total domination supercritical graphs with respect to relative complements. Discret. Math. 258(1-3): 361-371 (2002) - [j58]Teresa W. Haynes, Michael A. Henning:
Trees with unique minimum total dominating sets. Discuss. Math. Graph Theory 22(2): 233-246 (2002) - [j57]Michael A. Henning:
A characterization of Roman trees. Discuss. Math. Graph Theory 22(2): 325-334 (2002) - [j56]Wayne Goddard, Michael A. Henning:
Vertex Coverings by Coloured Induced Graphs - Frames and Umbrellas. Electron. Notes Discret. Math. 11: 338-348 (2002) - [j55]Wayne Goddard, Michael A. Henning:
Domination in planar graphs with small diameter. J. Graph Theory 40(1): 1-25 (2002) - [j54]Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning:
Domination in Graphs Applied to Electric Power Networks. SIAM J. Discret. Math. 15(4): 519-529 (2002) - 2001
- [j53]Michael A. Henning, Ortrud R. Oellermann:
The average connectivity of regular multipartite tournaments. Australas. J Comb. 23: 101-114 (2001) - [j52]David P. Day, Wayne Goddard, Michael A. Henning, Henda C. Swart:
Multipartite Ramsey Numbers. Ars Comb. 58 (2001) - [j51]Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe:
Domination and total domination critical trees with respect to relative complements. Ars Comb. 59 (2001) - [j50]Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley:
Stable and unstable graphs with total irredundance number zero. Ars Comb. 61 (2001) - [j49]Odile Favaron, Michael A. Henning, Joël Puech, Dieter Rautenbach:
On domination and annihilation in graphs with claw-free blocks. Discret. Math. 231(1-3): 143-151 (2001) - [j48]Wayne Goddard, Michael A. Henning:
Pancyclicity of the prism. Discret. Math. 234(1-3): 139-142 (2001) - 2000
- [j47]Teresa W. Haynes, Michael A. Henning:
A characterization of domination 4-relative-critical graphs of diameter 5. Australas. J Comb. 22: 19-36 (2000) - [j46]Teresa W. Haynes, Michael A. Henning:
The domatic numbers of factors of graphs. Ars Comb. 56 (2000) - [j45]Gayla S. Domke, Johannes H. Hattingh, Michael A. Henning, Lisa R. Markus:
Restrained domination in trees. Discret. Math. 211: 1-9 (2000) - [j44]Michael A. Henning:
Graphs with least domination number three-fifths their order. Discret. Math. 216(1-3): 153-168 (2000) - [j43]Wayne Goddard, Michael A. Henning, Ortrud R. Oellermann:
Bipartite Ramsey numbers and Zarankiewicz numbers. Discret. Math. 219(1-3): 85-95 (2000) - [j42]Odile Favaron, Michael A. Henning, Christina M. Mynhardt, Joël Puech:
Total domination in graphs with minimum degree three. J. Graph Theory 34(1): 9-19 (2000) - [j41]Michael A. Henning:
On cliques and bicliques. J. Graph Theory 34(1): 60-66 (2000) - [j40]Johannes H. Hattingh, Michael A. Henning:
Characterizations of trees with equal domination parameters. J. Graph Theory 34(2): 142-153 (2000) - [j39]Michael A. Henning:
Graphs with large total domination number. J. Graph Theory 35(1): 21-45 (2000)
1990 – 1999
- 1999
- [j38]Michael A. Henning, C. H. C. Little:
On the principal edge bipartition of a graph. Australas. J Comb. 20: 91-96 (1999) - [j37]Michael A. Henning:
Graphs with large restrained domination number. Discret. Math. 197-198: 415-429 (1999) - [j36]Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae:
Minus domination in graphs. Discret. Math. 199(1-3): 35-47 (1999) - [j35]Wayne Goddard, Michael A. Henning:
Real and integer domination in graphs. Discret. Math. 199(1-3): 61-75 (1999) - [j34]Gerd Fricke, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning:
On perfect neighborhood sets in graphs. Discret. Math. 199(1-3): 221-225 (1999) - [j33]Lowell W. Beineke, Izak Broere, Michael A. Henning:
Queens graphs. Discret. Math. 206(1-3): 63-75 (1999) - [j32]Wayne Goddard, Michael A. Henning, Hiren Maharaj:
Homogeneous Embeddings of Cycles in Graphs. Graphs Comb. 15(2): 159-173 (1999) - [j31]Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart:
Generalized eccentricity, radius, and diameter in graphs. Networks 34(4): 312-319 (1999) - 1998
- [j30]Michael A. Henning, Peter J. Slater:
Closed neighborhood order dominating functions. Australas. J Comb. 17: 77-88 (1998) - [j29]Teresa W. Haynes, Michael A. Henning:
Domination critical graphs with respect to relative complements. Australas. J Comb. 18: 115-126 (1998) - [j28]Johannes H. Hattingh, Elna Ungerer, Michael A. Henning:
Partial signed domination in graphs. Ars Comb. 48 (1998) - [j27]Johannes H. Hattingh, Michael A. Henning, Jacobus L. Walters:
Distance irredundance in graphs: complexity issues. Ars Comb. 50 (1998) - [j26]Michael A. Henning, Hiren Maharaj:
Some General Aspects of the Framing Number of a Digraph. Discret. Appl. Math. 82(1-3): 115-133 (1998) - [j25]Johannes H. Hattingh, Michael A. Henning:
Star-path bipartite Ramsey numbers, . Discret. Math. 185(1-3): 255-258 (1998) - [j24]Michael A. Henning:
Packing in trees. Discret. Math. 186(1-3): 145-155 (1998) - [j23]Michael A. Henning, Hugh R. Hind:
Strict majority functions on graphs. J. Graph Theory 28(1): 49-56 (1998) - 1997
- [j22]Michael A. Henning, Hiren Maharaj:
Edge homogeneous embeddings of cycles in graphs. Australas. J Comb. 15: 257-270 (1997) - [j21]John G. Gimbel, Michael A. Henning, Zsolt Tuza:
Switching Distance Graphs. Ars Comb. 47 (1997) - [j20]Lowell W. Beineke, Michael A. Henning:
Opinion functions on trees. Discret. Math. 167-168: 127-139 (1997) - [j19]Roger C. Entringer, Wayne Goddard, Michael A. Henning:
A note on cliques and independent sets. J. Graph Theory 24(1): 21-23 (1997) - 1996
- [j18]Michael A. Henning:
Domination in regular graphs. Ars Comb. 43 (1996) - [j17]Jean E. Dunbar, Wayne Goddard, Stephen T. Hedetniemi, Alice A. McRae, Michael A. Henning:
The Algorithmic Complexity of Minus Domination in Graphs. Discret. Appl. Math. 68(1-2): 73-84 (1996) - [j16]Gerd Fricke, Michael A. Henning, Ortrud Oellermann, Henda C. Swart:
An Algorithm to Find Two Distance Domination Parameters in a Graph. Discret. Appl. Math. 68(1-2): 85-91 (1996) - [j15]Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae:
Minus domination in regular graphs. Discret. Math. 149(1-3): 311-312 (1996) - [j14]Michael A. Henning, Peter J. Slater:
Inequalities relating domination parameters in cubic graphs. Discret. Math. 158(1-3): 87-98 (1996) - [j13]Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart:
The diversity of domination. Discret. Math. 161(1-3): 161-173 (1996) - [j12]Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart:
Local edge domination critical graphs. Discret. Math. 161(1-3): 175-184 (1996) - 1995
- [j11]Johannes H. Hattingh, Michael A. Henning, Peter J. Slater:
The algorithmic complexity of signed domination in graphs. Australas. J Comb. 12: 101-112 (1995) - [j10]Gerd Fricke, Stephen T. Hedetniemi, Michael A. Henning:
Distance independence domination in graphs. Ars Comb. 41 (1995) - [j9]Izak Broere, Johannes H. Hattingh, Michael A. Henning, Alice A. McRae:
Majority domination in graphs. Discret. Math. 138(1-3): 125-135 (1995) - [j8]Michael A. Henning:
Irredundance perfect graphs. Discret. Math. 142(1-3): 107-120 (1995) - 1994
- [j7]Johannes H. Hattingh, Michael A. Henning, Peter J. Slater:
Three-valued k-neighborhood domination in graphs. Australas. J Comb. 9: 233-242 (1994) - [j6]Timothy J. Bean, Michael A. Henning, Henda C. Swart:
On the integrity of distance domination in graphs. Australas. J Comb. 10: 29-44 (1994) - [j5]Marietjie Frick, Michael A. Henning:
Extremal results on defective colorings of graphs. Discret. Math. 126(1-3): 151-158 (1994) - 1993
- [j4]Johannes H. Hattingh, Michael A. Henning, Jakobus L. Walters:
On the computational complexity of upper distance fractional domination. Australas. J Comb. 7: 133-144 (1993) - [j3]Michael A. Henning, Henda C. Swart:
Bounds relating generalized domination parameters. Discret. Math. 120(1-3): 93-105 (1993) - [j2]Gary Chartrand, Wayne Goddard, Michael A. Henning, Farrokh Saba, Henda C. Swart:
Principal Common Divisors of Graphs. Eur. J. Comb. 14(2): 85-93 (1993) - 1992
- [j1]Wayne Goddard, Michael A. Henning, Henda C. Swart:
Some nordhaus- gaddum-type results. J. Graph Theory 16(3): 221-231 (1992)
Coauthor Index
[j419] [j413] [j401] [j364] [j357] [j351] [j344] [j334] [j329] [j310] [j302] [j291] [j264] [j250] [j248] [j241] [j238] [j227] [j226] [j223] [j214] [j204] [j202] [j200] [j185] [j183] [j181] [j180] [j179] [j178] [j168] [j163] [j158] [j150] [j149] [j144] [j117] [j115] [j111] [j106] [j103] [j102] [j93] [j87] [j85] [j83] [j80] [j78] [j76] [j70] [j69] [p1] [j67] [j66] [j65] [j63] [j60] [j59] [j58] [j54] [j51] [j50] [j47] [j46] [j34] [j29]
Ortrud R. Oellermann
aka: Ortrud Oellermann
aka: Ortrud Oellermann
[j424] [j406] [j394] [j375] [j371] [j370] [j367] [j358] [j342] [j326] [j320] [j311] [j299] [j293] [j286] [j277] [j271] [j248] [j247] [j245] [j244] [j243] [j239] [j235] [j231] [j227] [j222] [j220] [j216] [j215] [j213] [j210] [j202] [j195] [j191] [j187] [j181] [j180] [j178] [j175] [j160] [j143] [j138] [j134] [j131] [j130] [j125] [j113]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-20 19:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
