Johannes H. Hattingh

Johannes H. Hattingh, Nader Jafari Rad, Sayyed Heidar Jafari, Marc Loizeaux, John Matthews, Lucas C. van der Merwe: Total edge critical graphs with leaves. Discrete Mathematics 312(24): 3482-3488 (2012)

Johannes H. Hattingh, Osama A. Saleh, Lucas C. van der Merwe, Terry J. Walters: A Nordhaus-Gaddum-type result for the induced path number. J. Comb. Optim. 24(3): 329-338 (2012)

Johannes H. Hattingh, Ernst J. Joubert: Restrained domination in cubic graphs. J. Comb. Optim. 22(2): 166-179 (2011)

Johannes H. Hattingh, Andrew R. Plummer: A Note on Restrained Domination in Trees. Ars Comb. 94 (2010)

Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Joubert: Bounds on the Total Restrained Domination Number of a Graph. Graphs and Combinatorics 26(1): 77-93 (2010)

Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Joubert: An upper bound on the total restrained domination number of a tree. J. Comb. Optim. 20(3): 205-223 (2010)

Johannes H. Hattingh, Ernst J. Joubert: An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree. Discrete Applied Mathematics 157(13): 2846-2858 (2009)

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)

Elizabeth Jonck, Johannes H. Hattingh, Charl J. Ras: A characterization of lambda_{d, 1}-minimal trees and other attainable classes. Discrete Mathematics 309(8): 2340-2348 (2009)

Johannes H. Hattingh, Ernst J. Joubert, Marc Loizeaux, Andrew R. Plummer, Lucas C. van der Merwe: Restrained domination in unicyclic graphs. Discussiones Mathematicae Graph Theory 29(1): 71-86 (2009)

Johannes H. Hattingh, Ernst J. Joubert: Restrained Domination in Claw-Free Graphs with Minimum Degree at Least Two. Graphs and Combinatorics 25(5): 693-706 (2009)

Hua-ming Xing, Johannes H. Hattingh, Andrew R. Plummer: On the domination number of Hamiltonian graphs with minimum degree six. Appl. Math. Lett. 21(10): 1037-1040 (2008)

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

Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Joubert, Andrew R. Plummer: Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs. Discrete Mathematics 308(7): 1080-1087 (2008)

Johannes H. Hattingh, Andrew R. Plummer: Restrained bondage in graphs. Discrete Mathematics 308(23): 5446-5453 (2008)

Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Joubert, Andrew R. Plummer: Total restrained domination in trees. Discrete Mathematics 307(13): 1643-1650 (2007)

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)

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)

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)

Gayla S. Domke, Johannes H. Hattingh, Lisa R. Markus: On weakly connected domination in graphs II. Discrete Mathematics 305(1-3): 112-122 (2005)

Peter Dankelmann, Gayla S. Domke, Wayne Goddard, Paul J. P. Grobler, Johannes H. Hattingh, Henda C. Swart: Maximum sizes of graphs with given domination parameters. Discrete Mathematics 281(1-3): 137-148 (2004)

Gayla S. Domke, Johannes H. Hattingh, Lisa R. Markus, Elna Ungerer: On parameters related to strong and weak domination in graphs. Discrete Mathematics 258(1-3): 1-11 (2002)

Gayla S. Domke, Johannes H. Hattingh, Michael A. Henning, Lisa R. Markus: Restrained domination in trees. Discrete Mathematics 211: 1-9 (2000)

Johannes H. Hattingh, Michael A. Henning: Characterizations of trees with equal domination parameters. Journal of Graph Theory 34(2): 142-153 (2000)

Jean E. Dunbar, Johannes H. Hattingh, Renu Laskar, Lisa R. Markus: Domination Using Induced Cliques in Graphs. Ars Comb. 52 (1999)

Gayla S. Domke, Johannes H. Hattingh, Stephen T. Hedetniemi, Renu C. Laskar, Lisa R. Markus: Restrained domination in graphs. Discrete Mathematics 203(1-3): 61-69 (1999)

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

Johannes H. Hattingh, Renu Laskar: On weak domination in graphs. Ars Comb. 49 (1998)

Izak Broere, Jean E. Dunbar, Johannes H. Hattingh: Minus k-subdomination in graphs. Ars Comb. 50 (1998)

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

Johannes H. Hattingh, Elna Ungerer: The signed and minus k-subdomination numbers of comets. Discrete Mathematics 183(1-3): 141-152 (1998)

Johannes H. Hattingh, Michael A. Henning: Star-path bipartite Ramsey numbers^, . Discrete Mathematics 185(1-3): 255-258 (1998)

Jean E. Dunbar, Jerrold W. Grossman, Johannes H. Hattingh, Stephen T. Hedetniemi, Alice A. McRae: On weakly connected domination in graphs. Discrete Mathematics 167-168: 261-269 (1997)

Johannes H. Hattingh, Elna Ungerer: Minus k-subdomination in graphs II. Discrete Mathematics 171(1-3): 141-151 (1997)

Ernest J. Cockayne, Johannes H. Hattingh, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae: Using maximality and minimality conditions to construct inequality chains. Discrete Mathematics 176(1-3): 43-61 (1997)

Izak Broere, Johannes H. Hattingh, Michael A. Henning, Alice A. McRae: Majority domination in graphs. Discrete Mathematics 138(1-3): 125-135 (1995)

A. Barnard, E. M. Ehlers, Johannes H. Hattingh: Structure graphs and structure graph grammars. Inf. Sci. 73(3): 235-271 (1993)

Guantao Chen, Johannes H. Hattingh, Cecil C. Rousseau: Asymptotic bounds for irredundant and mixed Ramsey numbers. Journal of Graph Theory 17(2): 193-206 (1993)

Johannes H. Hattingh: On irredundant Ramsey numbers for graphs. Journal of Graph Theory 14(4): 437-441 (1990)