default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohannes H. Hattingh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j55]Johannes H. Hattingh, Elizabeth Jonck, Ronald J. Maartens:
The k -Ramsey number of two five cycles. AKCE Int. J. Graphs Comb. 21(1): 57-62 (2024)
2010 – 2019
- 2018
- [j54]Johannes H. Hattingh, Ernst J. Joubert
:
Some multicolor bipartite Ramsey numbers involving cycles and a small number of colors. Discret. Math. 341(5): 1325-1330 (2018) - 2017
- [j53]Michael Dorfling, Johannes H. Hattingh, Elizabeth Jonck:
Total domination in maximal outerplanar graphs. Discret. Appl. Math. 217: 506-511 (2017) - 2016
- [j52]Michael Dorfling, Johannes H. Hattingh, Elizabeth Jonck:
Total domination in maximal outerplanar graphs II. Discret. Math. 339(3): 1180-1188 (2016) - [j51]Johannes H. Hattingh, Osama A. Saleh, Lucas C. van der Merwe, Terry J. Walters:
Nordhaus-Gaddum Results for the Induced Path Number of a Graph When Neither the Graph Nor Its Complement Contains Isolates. Graphs Comb. 32(3): 987-996 (2016) - [j50]Johannes H. Hattingh, Ernst J. Joubert:
Equality in a bound that relates the size and the restrained domination number of a graph. J. Comb. Optim. 31(4): 1586-1608 (2016) - 2014
- [j49]Johannes H. Hattingh, Ernst J. Joubert:
Some Bistar Bipartite Ramsey Numbers. Graphs Comb. 30(5): 1175-1181 (2014) - 2012
- [j48]Johannes H. Hattingh, Nader Jafari Rad, Sayyed Heidar Jafari, Marc Loizeaux, John Matthews, Lucas C. van der Merwe:
Total edge critical graphs with leaves. Discret. Math. 312(24): 3482-3488 (2012) - [j47]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) - 2011
- [j46]Johannes H. Hattingh, Ernst J. Joubert:
Restrained domination in cubic graphs. J. Comb. Optim. 22(2): 166-179 (2011) - 2010
- [j45]Johannes H. Hattingh, Andrew R. Plummer:
A Note on Restrained Domination in Trees. Ars Comb. 94 (2010) - [j44]Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Joubert:
Bounds on the Total Restrained Domination Number of a Graph. Graphs Comb. 26(1): 77-93 (2010) - [j43]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)
2000 – 2009
- 2009
- [j42]Johannes H. Hattingh, Elizabeth Jonck, Charl J. Ras:
A class of full (d, 1)-colorable trees. Australas. J Comb. 45: 277-290 (2009) - [j41]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. Discret. Appl. Math. 157(13): 2846-2858 (2009) - [j40]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) - [j39]Elizabeth Jonck, Johannes H. Hattingh, Charl J. Ras:
A characterization of lambdad, 1-minimal trees and other attainable classes. Discret. Math. 309(8): 2340-2348 (2009) - [j38]Johannes H. Hattingh, Ernst J. Joubert, Marc Loizeaux, Andrew R. Plummer, Lucas C. van der Merwe:
Restrained domination in unicyclic graphs. Discuss. Math. Graph Theory 29(1): 71-86 (2009) - [j37]Johannes H. Hattingh, Ernst J. Joubert:
Restrained Domination in Claw-Free Graphs with Minimum Degree at Least Two. Graphs Comb. 25(5): 693-706 (2009) - 2008
- [j36]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) - [j35]Johannes H. Hattingh, Michael A. Henning:
Restrained Domination Excellent Trees. Ars Comb. 87 (2008) - [j34]Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Joubert, Andrew R. Plummer:
Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs. Discret. Math. 308(7): 1080-1087 (2008) - [j33]Johannes H. Hattingh, Andrew R. Plummer:
Restrained bondage in graphs. Discret. Math. 308(23): 5446-5453 (2008) - 2007
- [j32]Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Joubert, Andrew R. Plummer:
Total restrained domination in trees. Discret. Math. 307(13): 1643-1650 (2007) - [j31]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) - 2006
- [j30]Laura M. Harris, Johannes H. Hattingh, Michael A. Henning:
Total k-subdominating functions on graphs. Australas. J Comb. 35: 141-154 (2006) - [j29]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) - [j28]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) - [j27]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
- [j26]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) - [j25]Gayla S. Domke, Johannes H. Hattingh, Lisa R. Markus:
On weakly connected domination in graphs II. Discret. Math. 305(1-3): 112-122 (2005) - 2004
- [j24]Laura M. Harris, Johannes H. Hattingh:
The algorithmic complexity of certain functional variations of total domination in graphs. Australas. J Comb. 29: 143-156 (2004) - [j23]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. Discret. Math. 281(1-3): 137-148 (2004) - 2002
- [j22]Gayla S. Domke, Johannes H. Hattingh, Lisa R. Markus, Elna Ungerer:
On parameters related to strong and weak domination in graphs. Discret. Math. 258(1-3): 1-11 (2002) - 2000
- [j21]Gayla S. Domke, Johannes H. Hattingh, Michael A. Henning, Lisa R. Markus:
Restrained domination in trees. Discret. Math. 211: 1-9 (2000) - [j20]Johannes H. Hattingh, Michael A. Henning:
Characterizations of trees with equal domination parameters. J. Graph Theory 34(2): 142-153 (2000)
1990 – 1999
- 1999
- [j19]Jean E. Dunbar, Johannes H. Hattingh, Renu C. Laskar, Lisa R. Markus:
Domination Using Induced Cliques in Graphs. Ars Comb. 52 (1999) - [j18]Gayla S. Domke, Johannes H. Hattingh, Stephen T. Hedetniemi, Renu C. Laskar, Lisa R. Markus:
Restrained domination in graphs. Discret. Math. 203(1-3): 61-69 (1999) - 1998
- [j17]Johannes H. Hattingh, Alice A. McRae, Elna Ungerer:
Minus k-subdomination in graphs III. Australas. J Comb. 17: 69-76 (1998) - [j16]Johannes H. Hattingh, Elna Ungerer, Michael A. Henning:
Partial signed domination in graphs. Ars Comb. 48 (1998) - [j15]Johannes H. Hattingh, Renu C. Laskar:
On weak domination in graphs. Ars Comb. 49 (1998) - [j14]Izak Broere, Jean E. Dunbar, Johannes H. Hattingh:
Minus k-subdomination in graphs. Ars Comb. 50 (1998) - [j13]Johannes H. Hattingh, Michael A. Henning, Jacobus L. Walters:
Distance irredundance in graphs: complexity issues. Ars Comb. 50 (1998) - [j12]Johannes H. Hattingh, Elna Ungerer:
The signed and minus k-subdomination numbers of comets. Discret. Math. 183(1-3): 141-152 (1998) - [j11]Johannes H. Hattingh, Michael A. Henning:
Star-path bipartite Ramsey numbers, . Discret. Math. 185(1-3): 255-258 (1998) - 1997
- [j10]Jean E. Dunbar, Jerrold W. Grossman, Johannes H. Hattingh, Stephen T. Hedetniemi, Alice A. McRae:
On weakly connected domination in graphs. Discret. Math. 167-168: 261-269 (1997) - [j9]Johannes H. Hattingh, Elna Ungerer:
Minus k-subdomination in graphs II. Discret. Math. 171(1-3): 141-151 (1997) - [j8]Ernest J. Cockayne, Johannes H. Hattingh, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae:
Using maximality and minimality conditions to construct inequality chains. Discret. Math. 176(1-3): 43-61 (1997) - 1995
- [j7]Johannes H. Hattingh, Michael A. Henning, Peter J. Slater:
The algorithmic complexity of signed domination in graphs. Australas. J Comb. 12: 101-112 (1995) - [j6]Izak Broere, Johannes H. Hattingh, Michael A. Henning, Alice A. McRae:
Majority domination in graphs. Discret. Math. 138(1-3): 125-135 (1995) - 1994
- [j5]Johannes H. Hattingh, Michael A. Henning, Peter J. Slater:
Three-valued k-neighborhood domination in graphs. Australas. J Comb. 9: 233-242 (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]Andries Barnard, E. M. Ehlers, Johannes H. Hattingh:
Structure graphs and structure graph grammars. Inf. Sci. 73(3): 235-271 (1993) - [j2]Guantao Chen, Johannes H. Hattingh, Cecil C. Rousseau:
Asymptotic bounds for irredundant and mixed Ramsey numbers. J. Graph Theory 17(2): 193-206 (1993) - 1990
- [j1]Johannes H. Hattingh:
On irredundant Ramsey numbers for graphs. J. Graph Theory 14(4): 437-441 (1990)
Coauthor Index
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 2024-07-09 21:17 CEST 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:
