Search the dblp DataBase
Johannes H. Hattingh :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Izak Broere , Jean E. Dunbar , Johannes H. Hattingh Minus k-subdomination in graphs. [Citation Graph (0, 0)][DBLP ] Ars Comb., 1998, v:50, n:, pp:- [Journal ] Jean E. Dunbar , Johannes H. Hattingh , Renu Laskar , Lisa R. Markus Domination Using Induced Cliques in Graphs. [Citation Graph (0, 0)][DBLP ] Ars Comb., 1999, v:52, n:, pp:- [Journal ] Johannes H. Hattingh , Michael A. Henning , Jacobus L. Walters Distance irredundance in graphs: complexity issues. [Citation Graph (0, 0)][DBLP ] Ars Comb., 1998, v:50, n:, pp:- [Journal ] Johannes H. Hattingh , Renu Laskar On weak domination in graphs. [Citation Graph (0, 0)][DBLP ] Ars Comb., 1998, v:49, n:, pp:- [Journal ] Johannes H. Hattingh , Elna Ungerer , Michael A. Henning Partial signed domination in graphs. [Citation Graph (0, 0)][DBLP ] Ars Comb., 1998, v:48, n:, pp:- [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:281, n:1-3, pp:137-148 [Journal ] Gayla S. Domke , Johannes H. Hattingh , Michael A. Henning , Lisa R. Markus Restrained domination in trees. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2000, v:211, n:, pp:1-9 [Journal ] Gayla S. Domke , Johannes H. Hattingh , Lisa R. Markus On weakly connected domination in graphs II. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2005, v:305, n:1-3, pp:112-122 [Journal ] Gayla S. Domke , Johannes H. Hattingh , Lisa R. Markus , Elna Ungerer On parameters related to strong and weak domination in graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:258, n:1-3, pp:1-11 [Journal ] Michael A. Dorfling , Wayne Goddard , Johannes H. Hattingh , Michael A. Henning Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2005, v:300, n:1-3, pp:82-90 [Journal ] Johannes H. Hattingh , Elizabeth Jonck , Ernst J. Joubert , Andrew R. Plummer Total restrained domination in trees. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:13, pp:1643-1650 [Journal ] A. Barnard , E. M. Ehlers , Johannes H. Hattingh Structure graphs and structure graph grammars. [Citation Graph (0, 0)][DBLP ] Inf. Sci., 1993, v:73, n:3, pp:235-271 [Journal ] Gayla S. Domke , Johannes H. Hattingh , Stephen T. Hedetniemi , Renu C. Laskar , Lisa R. Markus Restrained domination in graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1999, v:203, n:1-3, pp:61-69 [Journal ] Johannes H. Hattingh , Elna Ungerer The signed and minus k-subdomination numbers of comets. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:183, n:1-3, pp:141-152 [Journal ] Johannes H. Hattingh , Michael A. Henning Star-path bipartite Ramsey numbers, . [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:185, n:1-3, pp:255-258 [Journal ] Johannes H. Hattingh , Elna Ungerer Minus k-subdomination in graphs II. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1997, v:171, n:1-3, pp:141-151 [Journal ] Ernest J. Cockayne , Johannes H. Hattingh , Sandra Mitchell Hedetniemi , Stephen T. Hedetniemi , Alice A. McRae Using maximality and minimality conditions to construct inequality chains. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1997, v:176, n:1-3, pp:43-61 [Journal ] Jean E. Dunbar , Jerrold W. Grossman , Johannes H. Hattingh , Stephen T. Hedetniemi , Alice A. McRae On weakly connected domination in graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1997, v:167, n:, pp:261-269 [Journal ] Izak Broere , Johannes H. Hattingh , Michael A. Henning , Alice A. McRae Majority domination in graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1995, v:138, n:1-3, pp:125-135 [Journal ] On the domination number of Hamiltonian graphs with minimum degree six. [Citation Graph (, )][DBLP ] Restrained Domination Excellent Trees. [Citation Graph (, )][DBLP ] Bounds relating the weakly connected domination number to the total domination number and the matching number. [Citation Graph (, )][DBLP ] An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree. [Citation Graph (, )][DBLP ] On equality in an upper bound for the restrained and total domination numbers of a graph. [Citation Graph (, )][DBLP ] Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs. [Citation Graph (, )][DBLP ] Restrained bondage in graphs. [Citation Graph (, )][DBLP ] A characterization of lambdad, 1 -minimal trees and other attainable classes. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.004secs