On irredundant Ramsey numbers for graphs. - Johannes H. Hattingh (J. Graph Theory, 1990)

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

Structure graphs and structure graph grammars. - Andries Barnard; E. M. Ehlers; Johannes H. Hattingh (Inf. Sci., 1993)

Asymptotic bounds for irredundant and mixed Ramsey numbers. - Guantao Chen; Johannes H. Hattingh; Cecil C. Rousseau (J. Graph Theory, 1993)

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

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

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

Using maximality and minimality conditions to construct inequality chains. - Ernest J. Cockayne; Johannes H. Hattingh; Sandra Mitchell Hedetniemi; Stephen T. Hedetniemi; Alice A. McRae (Discret. Math., 1997)

On weakly connected domination in graphs. - Jean E. Dunbar; Jerrold W. Grossman; Johannes H. Hattingh; Stephen T. Hedetniemi; Alice A. McRae (Discret. Math., 1997)

Minus k-subdomination in graphs II. - Johannes H. Hattingh; Elna Ungerer (Discret. Math., 1997)

Minus k-subdomination in graphs III. - Johannes H. Hattingh; Alice A. McRae; Elna Ungerer (Australas. J Comb., 1998)

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

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

On weak domination in graphs. - Johannes H. Hattingh; Renu C. Laskar (Ars Comb., 1998)

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

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

The signed and minus k-subdomination numbers of comets. - Johannes H. Hattingh; Elna Ungerer (Discret. Math., 1998)

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

Restrained domination in graphs. - Gayla S. Domke; Johannes H. Hattingh; Stephen T. Hedetniemi; Renu C. Laskar; Lisa R. Markus (Discret. Math., 1999)

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

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

On parameters related to strong and weak domination in graphs. - Gayla S. Domke; Johannes H. Hattingh; Lisa R. Markus; Elna Ungerer (Discret. Math., 2002)

The algorithmic complexity of certain functional variations of total domination in graphs. - Laura M. Harris; Johannes H. Hattingh (Australas. J Comb., 2004)

Maximum sizes of graphs with given domination parameters. - Peter Dankelmann; Gayla S. Domke; Wayne Goddard; Paul J. P. Grobler; Johannes H. Hattingh; Henda C. Swart (Discret. Math., 2004)

On weakly connected domination in graphs II. - Gayla S. Domke; Johannes H. Hattingh; Lisa R. Markus (Discret. Math., 2005)

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

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

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

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

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

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

Total restrained domination in trees. - Johannes H. Hattingh; Elizabeth Jonck; Ernst J. Joubert; Andrew R. Plummer (Discret. Math., 2007)

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

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

Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs. - Johannes H. Hattingh; Elizabeth Jonck; Ernst J. Joubert; Andrew R. Plummer (Discret. Math., 2008)

Restrained bondage in graphs. - Johannes H. Hattingh; Andrew R. Plummer (Discret. Math., 2008)

A class of full (d, 1)-colorable trees. - Johannes H. Hattingh; Elizabeth Jonck; Charl J. Ras (Australas. J Comb., 2009)

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

An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree. - Johannes H. Hattingh; Ernst J. Joubert (Discret. Appl. Math., 2009)

A characterization of lambdad, 1-minimal trees and other attainable classes. - Elizabeth Jonck; Johannes H. Hattingh; Charl J. Ras (Discret. Math., 2009)

Restrained domination in unicyclic graphs. - Johannes H. Hattingh; Ernst J. Joubert; Marc Loizeaux; Andrew R. Plummer; Lucas C. van der Merwe (Discuss. Math. Graph Theory, 2009)

Restrained Domination in Claw-Free Graphs with Minimum Degree at Least Two. - Johannes H. Hattingh; Ernst J. Joubert (Graphs Comb., 2009)

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

Bounds on the Total Restrained Domination Number of a Graph. - Johannes H. Hattingh; Elizabeth Jonck; Ernst J. Joubert (Graphs Comb., 2010)

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

Restrained domination in cubic graphs. - Johannes H. Hattingh; Ernst J. Joubert (J. Comb. Optim., 2011)

Total edge critical graphs with leaves. - Johannes H. Hattingh; Nader Jafari Rad; Sayyed Heidar Jafari; Marc Loizeaux; John Matthews; Lucas C. van der Merwe (Discret. Math., 2012)

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

Some Bistar Bipartite Ramsey Numbers. - Johannes H. Hattingh; Ernst J. Joubert (Graphs Comb., 2014)

Total domination in maximal outerplanar graphs II. - Michael Dorfling; Johannes H. Hattingh; Elizabeth Jonck (Discret. Math., 2016)

Nordhaus-Gaddum Results for the Induced Path Number of a Graph When Neither the Graph Nor Its Complement Contains Isolates. - Johannes H. Hattingh; Osama A. Saleh; Lucas C. van der Merwe; Terry J. Walters (Graphs Comb., 2016)

Equality in a bound that relates the size and the restrained domination number of a graph. - Johannes H. Hattingh; Ernst J. Joubert (J. Comb. Optim., 2016)

Total domination in maximal outerplanar graphs. - Michael Dorfling; Johannes H. Hattingh; Elizabeth Jonck (Discret. Appl. Math., 2017)

Some multicolor bipartite Ramsey numbers involving cycles and a small number of colors. - Johannes H. Hattingh; Ernst J. Joubert (Discret. Math., 2018)

The k -Ramsey number of two five cycles. - Johannes H. Hattingh; Elizabeth Jonck; Ronald J. Maartens (AKCE Int. J. Graphs Comb., 2024)

Bipartite Ramsey number pairs involving cycles. - Ernst J. Joubert; Johannes H. Hattingh (Discuss. Math. Graph Theory, 2025)