| 2013 | ||
|---|---|---|
| j201 | Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning: Relating the annihilation number and the total domination number of a tree. Discrete Applied Mathematics 161(3): 349-354 (2013) | |
| j200 | Michael A. Henning, Anders Yeo: Total domination and matching numbers in graphs with all vertices in triangles. Discrete Mathematics 313(2): 174-181 (2013) | |
| j199 | Wayne Goddard, Michael A. Henning: Independent domination in graphs: A survey and recent results. Discrete Mathematics 313(7): 839-854 (2013) | |
| j198 | Michael A. Henning, Anders Yeo: Hypergraphs with large transversal number. Discrete Mathematics 313(8): 959-966 (2013) | |
| j197 | Michael A. Henning, Dieter Rautenbach, Philipp Matthias Schäfer: Open packing, total domination, and the P3-Radon number. Discrete Mathematics 313(9): 992-998 (2013) | |
| j196 | Justin Southey, Michael A. Henning: Domination versus independent domination in cubic graphs. Discrete Mathematics 313(11): 1212-1220 (2013) | |
| j195 | Michael A. Henning, Douglas F. Rall: On graphs with disjoint dominating and 2-dominating sets. Discussiones Mathematicae Graph Theory 33(1): 139-146 (2013) | |
| j194 | Michael A. Henning, Anders Yeo: Transversals and matchings in 3-uniform hypergraphs. Eur. J. Comb. 34(2): 217-228 (2013) | |
| j193 | Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning: Edge lifting and total domination in graphs. J. Comb. Optim. 25(1): 47-59 (2013) | |
| j192 | Michael A. Henning, Anders Yeo: Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three. Journal of Graph Theory 72(2): 220-245 (2013) | |
| j191 | Justin Southey, Michael A. Henning: Edge Weighting Functions on Dominating Sets. Journal of Graph Theory 72(3): 346-360 (2013) | |
| 2012 | ||
| j190 | Michael A. Henning, Adel P. Kazemi: Total domination in inflated graphs. Discrete Applied Mathematics 160(1-2): 164-169 (2012) | |
| j189 | Yair Caro, Michael A. Henning: Directed domination in oriented graphs. Discrete Applied Mathematics 160(7-8): 1053-1063 (2012) | |
| j188 | Michael A. Henning, Ernst J. Joubert, Justin Southey: Multiple factor Nordhaus-Gaddum type results for domination and total domination. Discrete Applied Mathematics 160(7-8): 1137-1142 (2012) | |
| j187 | Michael A. Henning, Nader Jafari Rad: On α-total domination in graphs. Discrete Applied Mathematics 160(7-8): 1143-1151 (2012) | |
| j186 | Michael A. Henning, Christian Löwenstein: Hypergraphs with large domination number and with edge sizes at least three. Discrete Applied Mathematics 160(12): 1757-1765 (2012) | |
| j185 | Teresa W. Haynes, Michael A. Henning: A characterization of diameter-2-critical graphs whose complements are diamond-free. Discrete Applied Mathematics 160(13-14): 1979-1985 (2012) | |
| j184 | Michael A. Henning, Nader Jafari Rad: Locating-total domination in graphs. Discrete Applied Mathematics 160(13-14): 1986-1993 (2012) | |
| j183 | Teresa W. Haynes, Michael A. Henning, Anders Yeo: On a conjecture of Murty and Simon on diameter two critical graphs II. Discrete Mathematics 312(2): 315-323 (2012) | |
| j182 | Michael A. Henning, Lucas C. van der Merwe: The maximum diameter of total domination edge-critical graphs. Discrete Mathematics 312(2): 397-404 (2012) | |
| j181 | 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]. Discrete Mathematics 312(5): 1076 (2012) | |
| j180 | Michael A. Henning, Christian Löwenstein, Dieter Rautenbach: Independent sets and matchings in subcubic graphs. Discrete Mathematics 312(11): 1900-1910 (2012) | |
| j179 | Michael A. Henning, Christian Löwenstein: Locating-total domination in claw-free cubic graphs. Discrete Mathematics 312(21): 3107-3116 (2012) | |
| j178 | Csilla Bujtás, Michael A. Henning, Zsolt Tuza: Transversals and domination in uniform hypergraphs. Eur. J. Comb. 33(1): 62-72 (2012) | |
| j177 | Michael A. Henning, Anders Yeo: Girth and Total Domination in Graphs. Graphs and Combinatorics 28(2): 199-214 (2012) | |
| j176 | Justin Southey, Michael A. Henning: An Improved Upper Bound on the Total Restrained Domination Number in Cubic Graphs. Graphs and Combinatorics 28(4): 547-554 (2012) | |
| j175 | Michael A. Henning, Adel P. Kazemi: k-tuple total domination in cross products of graphs. J. Comb. Optim. 24(3): 339-346 (2012) | |
| j174 | Bostjan Bresar, Paul Dorbec, Wayne Goddard, Bert Hartnell, Michael A. Henning, Sandi Klavzar, Douglas F. Rall: Vizing's conjecture: a survey and recent results. Journal of Graph Theory 69(1): 46-76 (2012) | |
| j173 | Michael A. Henning, Anders Yeo: Vertex Disjoint Cycles of Different Length in Digraphs. SIAM J. Discrete Math. 26(2): 687-694 (2012) | |
| 2011 | ||
| j172 | Michael A. Henning, Ernst J. Joubert, Justin Southey: Nordhaus-Gaddum bounds for total domination. Appl. Math. Lett. 24(6): 987-990 (2011) | |
| j171 | 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) | |
| j170 | Frank Bullock, Peter Dankelmann, Marietjie Frick, Michael A. Henning, Ortrud R. Oellermann, Susan A. van Aardt: Hamiltonicity of k-Traceable Graphs. Electr. J. Comb. 18(1) (2011) | |
| j169 | Michael A. Henning, Ingo Schiermeyer, Anders Yeo: A New Bound on the Domination Number of Graphs with Minimum Degree Two. Electr. J. Comb. 18(1) (2011) | |
| j168 | Michael A. Henning, Nader Jafari Rad: Total domination dot-critical graphs. Discrete Applied Mathematics 159(2-3): 104-111 (2011) | |
| j167 | Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning: An extremal problem for total domination stable graphs upon edge removal. Discrete Applied Mathematics 159(10): 1048-1052 (2011) | |
| j166 | Michael A. Henning, Nader Jafari Rad, Joanna Raczek: A note on total reinforcement in graphs. Discrete Applied Mathematics 159(14): 1443-1446 (2011) | |
| j165 | Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning: Total domination changing and stable graphs upon vertex removal. Discrete Applied Mathematics 159(15): 1548-1554 (2011) | |
| j164 | Yair Caro, Michael A. Henning: A Greedy Partition Lemma for directed domination. Discrete Optimization 8(3): 452-458 (2011) | |
| j163 | Teresa W. Haynes, Michael A. Henning, Anders Yeo: A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free. Discrete Optimization 8(3): 495-501 (2011) | |
| j162 | 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. Discrete Mathematics 311(13): 1142-1149 (2011) | |
| j161 | S. Arumugam, Teresa W. Haynes, Michael A. Henning, Yared Nigussie: Maximal independent sets in minimum colorings. Discrete Mathematics 311(13): 1158-1163 (2011) | |
| j160 | 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. Discrete Mathematics 311(17): 1918-1924 (2011) | |
| j159 | Michael A. Henning, Christian Löwenstein, Dieter Rautenbach: Dominating sets, packings, and the maximum degree. Discrete Mathematics 311(18-19): 2031-2036 (2011) | |
| j158 | Michael A. Henning, Ernst J. Joubert, Justin Southey: Nordhaus-Gaddum Type Results for Total Domination. Discrete Mathematics & Theoretical Computer Science 13(3): 87-96 (2011) | |
| j157 | Michael A. Henning, Anders Yeo: Perfect Matchings in Total Domination Critical Graphs. Graphs and Combinatorics 27(5): 685-701 (2011) | |
| j156 | Michael A. Henning, John McCoy: Which trees have a differentiating-paired dominating set? J. Comb. Optim. 22(1): 1-18 (2011) | |
| j155 | Justin Southey, Michael A. Henning: A characterization of graphs with disjoint dominating and paired-dominating sets. J. Comb. Optim. 22(2): 217-234 (2011) | |
| j154 | Paul Dorbec, Michael A. Henning: Upper paired-domination in claw-free graphs. J. Comb. Optim. 22(2): 235-251 (2011) | |
| 2010 | ||
| j153 | 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) | |
| j152 | Michael A. Henning, Lucas C. van der Merwe: Properties of total domination edge-critical graphs. Discrete Applied Mathematics 158(2): 147-153 (2010) | |
| j151 | Michael A. Henning, Adel P. Kazemi: k-tuple total domination in graphs. Discrete Applied Mathematics 158(9): 1006-1011 (2010) | |
| j150 | Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning: Total domination critical and stable graphs upon edge removal. Discrete Applied Mathematics 158(15): 1587-1592 (2010) | |
| j149 | Michael A. Henning, Christian Löwenstein, Dieter Rautenbach, Justin Southey: Disjoint dominating and total dominating sets in graphs. Discrete Applied Mathematics 158(15): 1615-1623 (2010) | |
| j148 | Michael A. Henning: Erratum to: "Local edge domination critical graphs" [Discrete Mathematics 161 (1996) 175-184]. Discrete Mathematics 310(10-11): 1648 (2010) | |
| j147 | Michael A. Henning: An upper bound on the paired-domination number in terms of the number of edges in the graph. Discrete Mathematics 310(21): 2847-2857 (2010) | |
| j146 | Justin Southey, Michael A. Henning: On a conjecture on total domination in claw-free cubic graphs. Discrete Mathematics 310(21): 2984-2999 (2010) | |
| j145 | Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning: Total domination stable graphs upon edge addition. Discrete Mathematics 310(24): 3446-3454 (2010) | |
| j144 | Michael A. Henning, Christian Löwenstein, Dieter Rautenbach: Partitioning a graph into a dominating set, a total dominating set, and something else. Discussiones Mathematicae Graph Theory 30(4): 563-574 (2010) | |
| j143 | 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) | |
| j142 | Michael A. Henning, Anders Yeo: Strong Transversals in Hypergraphs and Double Total Domination in Graphs. SIAM J. Discrete Math. 24(4): 1336-1355 (2010) | |
| 2009 | ||
| j141 | Michael A. Henning: Restricted total domination in graphs with minimum degree two. Ars Comb. 90 (2009) | |
| j140 | Teresa W. Haynes, Michael A. Henning: Upper Bounds on the Total Domination Number. Ars Comb. 91 (2009) | |
| j139 | Michael A. Henning, Nader Jafari Rad: On total domination vertex critical graphs of high connectivity. Discrete Applied Mathematics 157(8): 1969-1973 (2009) | |
| j138 | Michael A. Henning, Simon Mukwembi: Domination, radius, and minimum degree. Discrete Applied Mathematics 157(13): 2964-2968 (2009) | |
| j137 | Johannes H. Hattingh, Michael A. Henning: Bounds relating the weakly connected domination number to the total domination number and the matching number. Discrete Applied Mathematics 157(14): 3086-3093 (2009) | |
| j136 | John McCoy, Michael A. Henning: Locating and paired-dominating sets in graphs. Discrete Applied Mathematics 157(15): 3268-3280 (2009) | |
| j135 | Michael A. Henning: A survey of selected recent results on total domination in graphs. Discrete Mathematics 309(1): 32-63 (2009) | |
| j134 | Allan Frendrup, Michael A. Henning, Bert Randerath, Preben D. Vestergaard: An upper bound on the domination number of a graph with minimum degree 2. Discrete Mathematics 309(4): 639-646 (2009) | |
| j133 | Alewyn P. Burger, Michael A. Henning, Jan H. van Vuuren: On the ratios between packing and domination parameters of a graph. Discrete Mathematics 309(8): 2473-2478 (2009) | |
| j132 | Teresa W. Haynes, Michael A. Henning, Ping Zhang: A dedication to Professor Gary Chartrand. Discrete Mathematics 309(19): 5803-5805 (2009) | |
| j131 | Teresa W. Haynes, Michael A. Henning, Ping Zhang: A survey of stratified domination in graphs. Discrete Mathematics 309(19): 5806-5819 (2009) | |
| j130 | Michael A. Henning, John McCoy: Total domination in planar graphs of diameter two. Discrete Mathematics 309(21): 6181-6189 (2009) | |
| j129 | Michael A. Henning, Christian Löwenstein, Dieter Rautenbach: Remarks about disjoint dominating sets. Discrete Mathematics 309(23-24): 6451-6458 (2009) | |
| j128 | Michael A. Henning, Morten Hegner Nielsen, Ortrud R. Oellermann: Local Steiner convexity. Eur. J. Comb. 30(5): 1186-1193 (2009) | |
| j127 | Wayne Goddard, Michael A. Henning: A Characterization of Cubic Graphs with Paired-Domination Number Three-Fifths Their Order. Graphs and Combinatorics 25(5): 675-692 (2009) | |
| j126 | 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) | |
| j125 | Michael A. Henning, Anders Yeo: Total domination in 2-connected graphs and in graphs with no induced 6-cycles. Journal of Graph Theory 60(1): 55-79 (2009) | |
| 2008 | ||
| j124 | Johannes H. Hattingh, Michael A. Henning: Restrained Domination Excellent Trees. Ars Comb. 87 (2008) | |
| j123 | Michael A. Henning, Justin Southey: A note on graphs with disjoint dominating and total dominating sets. Ars Comb. 89 (2008) | |
| j122 | Michael A. Henning, Jacob Elgin Maritz: Total restrained domination in graphs with minimum degree two. Discrete Mathematics 308(10): 1909-1920 (2008) | |
| j121 | Michael A. Henning, Liying Kang, Erfang Shan, Anders Yeo: On matching and total domination in graphs. Discrete Mathematics 308(11): 2313-2318 (2008) | |
| j120 | Odile Favaron, Michael A. Henning: Total domination in claw-free graphs with minimum degree 2. Discrete Mathematics 308(15): 3213-3219 (2008) | |
| j119 | Odile Favaron, Michael A. Henning: Bounds on total domination in claw-free cubic graphs. Discrete Mathematics 308(16): 3491-3507 (2008) | |
| j118 | Jochen Harant, Michael A. Henning, Dieter Rautenbach, Ingo Schiermeyer: The independence number in graphs of maximum degree three. Discrete Mathematics 308(23): 5829-5833 (2008) | |
| j117 | Michael A. Henning, Anders Yeo: Total Domination in Graphs with Given Girth. Graphs and Combinatorics 24(4): 333-348 (2008) | |
| j116 | 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) | |
| j115 | Allan Frendrup, Michael A. Henning, Preben D. Vestergaard: Total domination in partitioned trees and partitioned graphs with minimum degree two. J. Global Optimization 41(3): 385-399 (2008) | |
| j114 | Michael A. Henning, Anders Yeo: Hypergraphs with large transversal number and with edge sizes at least 3. Journal of Graph Theory 59(4): 326-348 (2008) | |
| 2007 | ||
| j113 | Michael A. Henning, Anders Yeo: A New Upper Bound on the Total Domination Number of a Graph. Electr. J. Comb. 14(1) (2007) | |
| j112 | Michael A. Henning, Preben D. Vestergaard: Domination in partitioned graphs with minimum degree two. Discrete Mathematics 307(9-10): 1115-1135 (2007) | |
| j111 | Michael A. Henning: Restricted domination in graphs with minimum degree 2. Discrete Mathematics 307(11-12): 1356-1366 (2007) | |
| j110 | Michael A. Henning, Dieter Rautenbach: On the irregularity of bipartite graphs. Discrete Mathematics 307(11-12): 1467-1472 (2007) | |
| j109 | 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. Discrete Mathematics 307(22): 2845-2852 (2007) | |
| j108 | Michael A. Henning, Anders Yeo: Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph. Graphs and Combinatorics 23(6): 647-657 (2007) | |
| j107 | ||
| j106 | Wayne Goddard, Michael A. Henning: Restricted domination parameters in graphs. J. Comb. Optim. 13(4): 353-363 (2007) | |
| j105 | Paul Dorbec, Sylvain Gravier, Michael A. Henning: Paired-domination in generalized claw-free graphs. J. Comb. Optim. 14(1): 1-7 (2007) | |
| j104 | Erfang Shan, Liying Kang, Michael A. Henning: Erratum to: "A linear vizing-like relation relating the size and total domination number of a graph". Journal of Graph Theory 54(4): 350-353 (2007) | |
| 2006 | ||
| j103 | Michael Dorfling, Wayne Goddard, Michael A. Henning: Domination in Planar Graphs with Small Diameter II. Ars Comb. 78 (2006) | |
| j102 | David Atkins, Teresa W. Haynes, Michael A. Henning: Placing monitoring devices in electric power networks modelled by block graphs. Ars Comb. 79 (2006) | |
| j101 | ||
| j100 | ||
| j99 | Michael A. Henning, Jacob Elgin Maritz: Stratification and Domination in Prisms. Ars Comb. 81 (2006) | |
| j98 | Michael A. Henning, Anders Yeo: Total Domination and Matching Numbers in Claw-Free Graphs. Electr. J. Comb. 13(1) (2006) | |
| j97 | Michael Dorfling, Michael A. Henning: A note on power domination in grid graphs. Discrete Applied Mathematics 154(6): 1023-1027 (2006) | |
| j96 | Teresa W. Haynes, Michael A. Henning, Jamie Howard: Locating and total dominating sets in trees. Discrete Applied Mathematics 154(8): 1293-1300 (2006) | |
| j95 | Peter Dankelmann, Michael A. Henning, Wayne Goddard, Renu Laskar: Simultaneous graph parameters: Factor domination and factor total domination. Discrete Mathematics 306(18): 2229-2233 (2006) | |
| j94 | Michael Dorfling, Wayne Goddard, Michael A. Henning, Christina M. Mynhardt: Construction of trees and graphs with equal domination parameters. Discrete Mathematics 306(21): 2647-2654 (2006) | |
| j93 | Laura M. Harris, Johannes H. Hattingh, Michael A. Henning: Algorithmic aspects of total k-subdomination in graphs. Discussiones Mathematicae Graph Theory 26(1): 5-18 (2006) | |
| 2005 | ||
| j92 | Teresa W. Haynes, Michael A. Henning, Peter J. Slater: Trees with Equal Domination and Paired-domination Numbers. Ars Comb. 76 (2005) | |
| j91 | Michael Dorfling, Wayne Goddard, Johannes H. Hattingh, Michael A. Henning: Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets. Discrete Mathematics 300(1-3): 82-90 (2005) | |
| j90 | Michael A. Henning, Jacob Elgin Maritz: Stratification and domination in graphs with minimum degree two. Discrete Mathematics 301(2-3): 175-194 (2005) | |
| j89 | Teresa W. Haynes, Michael A. Henning: Trees with two disjoint minimum independent dominating sets. Discrete Mathematics 304(1-3): 69-78 (2005) | |
| j88 | Robert C. Brigham, Teresa W. Haynes, Michael A. Henning, Douglas F. Rall: Bicritical domination. Discrete Mathematics 305(1-3): 18-32 (2005) | |
| j87 | Michael A. Henning: Graphs with double domination numbers. Discussiones Mathematicae Graph Theory 25(1-2): 13-28 (2005) | |
| j86 | Jochen Harant, Michael A. Henning: On Double Domination in Graphs. Discussiones Mathematicae Graph Theory 25(1-2): 29-34 (2005) | |
| j85 | Bostjan Bresar, Michael A. Henning, Douglas F. Rall: Paired-domination of Cartesian products of graphs and rainbow domination. Electronic Notes in Discrete Mathematics 22: 233-237 (2005) | |
| j84 | Michael A. Henning, Douglas F. Rall: On the Total Domination Number of Cartesian Products of Graphs. Graphs and Combinatorics 21(1): 63-69 (2005) | |
| j83 | Wayne Goddard, Michael A. Henning: Multiple vertex coverings by cliques. Journal of Graph Theory 48(2): 157-167 (2005) | |
| j82 | Michael A. Henning: A linear Vizing-like relation relating the size and total domination number of a graph. Journal of Graph Theory 49(4): 285-290 (2005) | |
| 2004 | ||
| j81 | Gary Chartrand, Teresa W. Haynes, Michael A. Henning, Ping Zhang: Detour Domination in Graphs. Ars Comb. 71 (2004) | |
| j80 | Michael A. Henning: Trees with equal average domination and independent domination numbers. Ars Comb. 71 (2004) | |
| j79 | Michael A. Henning, Ortrud Oellermann: Metric-Locating-Dominating Sets in Graphs. Ars Comb. 73 (2004) | |
| j78 | Michael A. Henning, Ortrud Oellermann: The average connectivity of a digraph. Discrete Applied Mathematics 140(1-3): 143-153 (2004) | |
| j77 | Michael A. Henning, Ortrud Oellermann: On upper domination Ramsey numbers for graphs. Discrete Mathematics 274(1-3): 125-135 (2004) | |
| j76 | Michael A. Henning: Signed total domination in graphs. Discrete Mathematics 278(1-3): 109-125 (2004) | |
| j75 | Teresa W. Haynes, Michael A. Henning, Lora Hopkins: Total domination subdivision numbers of trees. Discrete Mathematics 286(3): 195-202 (2004) | |
| j74 | Michael A. Henning, Jacob Elgin Maritz: Stratification and domination in graphs II. Discrete Mathematics 286(3): 203-211 (2004) | |
| j73 | Wayne Goddard, Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe: The diameter of total domination vertex critical graphs. Discrete Mathematics 286(3): 255-261 (2004) | |
| j72 | Michael A. Henning: Restricted total domination in graphs. Discrete Mathematics 289(1-3): 25-44 (2004) | |
| j71 | Teresa W. Haynes, Michael A. Henning, Lora Hopkins: Total domination subdivision numbers of graphs. Discussiones Mathematicae Graph Theory 24(3): 457-467 (2004) | |
| j70 | Odile Favaron, Michael A. Henning: Paired-Domination in Claw-Free Cubic Graphs. Graphs and Combinatorics 20(4): 447-456 (2004) | |
| 2003 | ||
| j69 | Sheng Bau, Michael A. Henning, Peter Dankelmann: Average lower independence in trees and outerplanar graphs. Ars Comb. 69 (2003) | |
| j68 | Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning: Global Defensive Alliances in Graphs. Electr. J. Comb. 10 (2003) | |
| j67 | Ernest J. Cockayne, Michael A. Henning, Christina M. Mynhardt: Vertices contained in all or in no minimum total dominating set of a tree. Discrete Mathematics 260(1-3): 37-44 (2003) | |
| j66 | Teresa W. Haynes, Michael A. Henning, Peter J. Slater: Strong equality of domination parameters in trees. Discrete Mathematics 260(1-3): 77-87 (2003) | |
| j65 | Sheng Bau, Michael A. Henning: Matching transformation graphs of cubic bipartite plane graphs. Discrete Mathematics 262(1-3): 27-36 (2003) | |
| j64 | Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Peter J. Slater: H-forming sets in graphs. Discrete Mathematics 262(1-3): 159-169 (2003) | |
| j63 | ||
| j62 | Michael A. Henning, Stephen T. Hedetniemi: Defending the Roman Empire--A new strategy. Discrete Mathematics 266(1-3): 239-251 (2003) | |
| j61 | Wayne Goddard, Michael A. Henning: Nordhaus-Gaddum bounds for independent domination. Discrete Mathematics 268(1-3): 299-302 (2003) | |
| j60 | Gary Chartrand, David Erwin, Michael A. Henning, Peter J. Slater, Ping Zhang: Graphs of order n with locating-chromatic number n-1. Discrete Mathematics 269(1-3): 65-79 (2003) | |
| j59 | Michael A. Henning: Defending the Roman Empire from multiple attacks. Discrete Mathematics 271(1-3): 101-115 (2003) | |
| j58 | Teresa W. Haynes, Michael A. Henning: Changing and unchanging domination: a classification. Discrete Mathematics 272(1): 65-79 (2003) | |
| j57 | Gary Chartrand, Teresa W. Haynes, Michael A. Henning, Ping Zhang: Stratification and domination in graphs. Discrete Mathematics 272(2-3): 171-185 (2003) | |
| j56 | Odile Favaron, Michael A. Henning: Upper total domination in claw-free graphs. Journal of Graph Theory 44(2): 148-158 (2003) | |
| 2002 | ||
| j55 | 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) | |
| j54 | Teresa W. Haynes, Michael A. Henning: Trees with equal domination and tree-free domination numbers. Discrete Mathematics 242(1-3): 93-102 (2002) | |
| j53 | Michael A. Henning, Ortrud Oellermann: The upper domination Ramsey number u(3, 3, 3). Discrete Mathematics 242(1-3): 103-113 (2002) | |
| j52 | Teresa W. Haynes, Michael A. Henning: A characterization of i-excellent trees. Discrete Mathematics 248(1-3): 69-77 (2002) | |
| j51 | ||
| j50 | ||
| j49 | Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley: Total irredundance in graphs. Discrete Mathematics 256(1-2): 115-127 (2002) | |
| j48 | Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe: Total domination supercritical graphs with respect to relative complements. Discrete Mathematics 258(1-3): 361-371 (2002) | |
| j47 | Teresa W. Haynes, Michael A. Henning: Trees with unique minimum total dominating sets. Discussiones Mathematicae Graph Theory 22(2): 233-246 (2002) | |
| j46 | Michael A. Henning: A characterization of Roman trees. Discussiones Mathematicae Graph Theory 22(2): 325-334 (2002) | |
| j45 | Wayne Goddard, Michael A. Henning: Vertex Coverings by Coloured Induced Graphs - Frames and Umbrellas. Electronic Notes in Discrete Mathematics 11: 338-348 (2002) | |
| j44 | Wayne Goddard, Michael A. Henning: Domination in planar graphs with small diameter. Journal of Graph Theory 40(1): 1-25 (2002) | |
| j43 | Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning: Domination in Graphs Applied to Electric Power Networks. SIAM J. Discrete Math. 15(4): 519-529 (2002) | |
| 2001 | ||
| j42 | David P. Day, Wayne Goddard, Michael A. Henning, Henda C. Swart: Multipartite Ramsey Numbers. Ars Comb. 58 (2001) | |
| j41 | 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) | |
| j40 | 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) | |
| j39 | Odile Favaron, Michael A. Henning, Joël Puech, Dieter Rautenbach: On domination and annihilation in graphs with claw-free blocks. Discrete Mathematics 231(1-3): 143-151 (2001) | |
| j38 | Wayne Goddard, Michael A. Henning: Pancyclicity of the prism. Discrete Mathematics 234(1-3): 139-142 (2001) | |
| 2000 | ||
| j37 | ||
| j36 | Gayla S. Domke, Johannes H. Hattingh, Michael A. Henning, Lisa R. Markus: Restrained domination in trees. Discrete Mathematics 211: 1-9 (2000) | |
| j35 | Michael A. Henning: Graphs with least domination number three-fifths their order. Discrete Mathematics 216(1-3): 153-168 (2000) | |
| j34 | Wayne Goddard, Michael A. Henning, Ortrud R. Oellermann: Bipartite Ramsey numbers and Zarankiewicz numbers. Discrete Mathematics 219(1-3): 85-95 (2000) | |
| j33 | Odile Favaron, Michael A. Henning, Christina M. Mynhardt, Joël Puech: Total domination in graphs with minimum degree three. Journal of Graph Theory 34(1): 9-19 (2000) | |
| j32 | ||
| j31 | Johannes H. Hattingh, Michael A. Henning: Characterizations of trees with equal domination parameters. Journal of Graph Theory 34(2): 142-153 (2000) | |
| j30 | Michael A. Henning: Graphs with large total domination number. Journal of Graph Theory 35(1): 21-45 (2000) | |
| 1999 | ||
| j29 | Michael A. Henning: Graphs with large restrained domination number. Discrete Mathematics 197-198: 415-429 (1999) | |
| j28 | Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae: Minus domination in graphs. Discrete Mathematics 199(1-3): 35-47 (1999) | |
| j27 | Wayne Goddard, Michael A. Henning: Real and integer domination in graphs. Discrete Mathematics 199(1-3): 61-75 (1999) | |
| j26 | Gerd Fricke, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning: On perfect neighborhood sets in graphs. Discrete Mathematics 199(1-3): 221-225 (1999) | |
| j25 | Lowell W. Beineke, Izak Broere, Michael A. Henning: Queens graphs. Discrete Mathematics 206(1-3): 63-75 (1999) | |
| j24 | Wayne Goddard, Michael A. Henning, Hiren Maharaj: Homogeneous Embeddings of Cycles in Graphs. Graphs and Combinatorics 15(2): 159-173 (1999) | |
| j23 | Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart: Generalized eccentricity, radius, and diameter in graphs. Networks 34(4): 312-319 (1999) | |
| 1998 | ||
| j22 | Johannes H. Hattingh, Elna Ungerer, Michael A. Henning: Partial signed domination in graphs. Ars Comb. 48 (1998) | |
| j21 | Johannes H. Hattingh, Michael A. Henning, Jacobus L. Walters: Distance irredundance in graphs: complexity issues. Ars Comb. 50 (1998) | |
| j20 | Michael A. Henning, Hiren Maharaj: Some General Aspects of the Framing Number of a Digraph. Discrete Applied Mathematics 82(1-3): 115-133 (1998) | |
| j19 | Johannes H. Hattingh, Michael A. Henning: Star-path bipartite Ramsey numbers, . Discrete Mathematics 185(1-3): 255-258 (1998) | |
| j18 | ||
| j17 | Michael A. Henning, Hugh R. Hind: Strict majority functions on graphs. Journal of Graph Theory 28(1): 49-56 (1998) | |
| 1997 | ||
| j16 | ||
| j15 | Lowell W. Beineke, Michael A. Henning: Opinion functions on trees. Discrete Mathematics 167-168: 127-139 (1997) | |
| j14 | Roger C. Entringer, Wayne Goddard, Michael A. Henning: A note on cliques and independent sets. Journal of Graph Theory 24(1): 21-23 (1997) | |
| 1996 | ||
| j13 | ||
| j12 | Jean E. Dunbar, Wayne Goddard, Stephen T. Hedetniemi, Alice A. McRae, Michael A. Henning: The Algorithmic Complexity of Minus Domination in Graphs. Discrete Applied Mathematics 68(1-2): 73-84 (1996) | |
| j11 | Gerd Fricke, Michael A. Henning, Ortrud Oellermann, Henda C. Swart: An Algorithm to Find Two Distance Domination Parameters in a Graph. Discrete Applied Mathematics 68(1-2): 85-91 (1996) | |
| j10 | Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae: Minus domination in regular graphs. Discrete Mathematics 149(1-3): 311-312 (1996) | |
| j9 | Michael A. Henning, Peter J. Slater: Inequalities relating domination parameters in cubic graphs. Discrete Mathematics 158(1-3): 87-98 (1996) | |
| j8 | Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart: The diversity of domination. Discrete Mathematics 161(1-3): 161-173 (1996) | |
| j7 | Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart: Local edge domination critical graphs. Discrete Mathematics 161(1-3): 175-184 (1996) | |
| 1995 | ||
| j6 | Izak Broere, Johannes H. Hattingh, Michael A. Henning, Alice A. McRae: Majority domination in graphs. Discrete Mathematics 138(1-3): 125-135 (1995) | |
| j5 | ||
| 1994 | ||
| j4 | Marietjie Frick, Michael A. Henning: Extremal results on defective colorings of graphs. Discrete Mathematics 126(1-3): 151-158 (1994) | |
| 1993 | ||
| j3 | Michael A. Henning, Henda C. Swart: Bounds relating generalized domination parameters. Discrete Mathematics 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. Journal of Graph Theory 16(3): 221-231 (1992) | |
Data released under the ODC-BY 1.0 license — See also our legal information page