Johannes Hattingh
Professor and Chair
Office: 706 COE
Office phone: 404.413.6448
E-mail: matjhh [at]langate.gsu.edu
Personal webpage
Education
B.Sc. Mathematics, Rand Afrikaans University, 1983
B.Sc. (Hons) Mathematics, Rand Afrikaans University, 1984
M.Sc. Mathematics, Rand Afrikaans University, 1985
Ph.D. Mathematics, Rand Afrikaans University, 1989
B.Sc. (Hons) Computer Science, Rand Afrikaans University, 1994
Research/Teaching
Dr. Johannes Hattingh’s area of expertise is domination in graphs, but he has published papers on graph coloring, graphical Ramsey theory and algebraic graph theory. Dr. Hattingh has over 60 publications in refereed journals.
His teaching interests include Discrete Mathematics, Combinatorics, Graph Theory, Number Theory and Abstract Algebra.
Selected Publications
J.H. Hattingh and M.A. Henning. Restrained domination excellent trees. To appear in Ars Combinatoria.
J.H. Hattingh, E. Jonck , E. Joubert and A.R. Plummer, Total restrained domination in trees. To appear in Discrete Mathematics.
J.H. Hattingh, E. Jonck and L.R. Markus, A note on the weakly connected subdivision number of a graph. To appear in The Bulletin of the Institute of Combinatorics and its Applications .
J.H. Hattingh and A. Plummer. A note on restrained domination in trees. To appear in Ars Combinatoria.
P. Dankelmann, J.H. Hattingh, M. A. Henning and H. C. Swart. Trees with equal domination and restrained domination numbers. Journal of Global Optimization 34 (2006), 597-607.
L.M. Harris, J.H. Hattingh and M.A. Henning. Total k-subdominating functions on graphs. Australasian Journal of Combinatorics 35 (2006) 141-154.
L.M. Harris, J.H. Hattingh and M.A. Henning. Algorithmic aspects of total k-subdomination in graphs. Discussiones Mathematicae Graph Theory 26(1) (2006) 5-18.
J.H. Hattingh, E. Jonck and C. Ras. The L(d,1)-hole index of paths and cycles. Utilitas Mathematica 69 (2006) 55-64.
G.S. Domke, J.H. Hattingh and L.R. Markus. On weakly connected domination in graphs II. Discrete Mathematics 305 (2005) 112-122.
W. Goddard, J.H. Hattingh and M.A. Henning. Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets. Discrete Mathematics 300 (2005) 82-90.
I. Broere, M. Dorfling, W. Goddard, J. H. Hattingh, M.A. Henning and E. Ungerer. Augmenting trees to have two disjoint total dominating sets. The Bulletin of the Institute of Combinatorics and its Applications 42 (2004) 12-18.
P. Dankelmann, G.S. Domke, W. Goddard, J. H. Hattingh and H.C. Swart. Maximum sizes for domination parameters. Discrete Mathematics 28 (2004) 137-148.
L.M. Harris and J. H. Hattingh. The algorithmic complexity of certain functional variations of total domination in graphs. Australasian Journal of Combinatorics 29 (2004) 143-156.
J.H. Hattingh, M.A. Henning and E. Ungerer. Graphs with small upper line-distinguishing and upper harmonious chromatic numbers. Journal of Combinatorial Mathematics and Combinatorial Computing 47 (2003) 165-181.
J.H. Hattingh, M.A. Henning and E. Ungerer. The upper line-distinguishing and upper harmonious chromatic numbers of a cycle. Journal of Combinatorial Mathematics and Combinatorial Computing 45 (2003) 139-146.
G.S. Domke, J.H. Hattingh, L.R. Markus and E. Ungerer. On parameters related to strong and weak domination in graphs. Discrete Mathematics 258 (2002) 1-11.
J.H. Hattingh and D. Rautenbach. Further results on weak domination in graphs. Utilitas Mathematica 61 (2002) 193-207.
L.M. Harris, J. H. Hattingh and E. Ungerer. The signed and minus k-subdomination number of certain multipartite graphs and their complement. Utilitas Mathematica 59 (2001) 77-95.
J.H. Hattingh and M.A. Henning. Characterizations of trees with equal domination parameters. Journal of Graph Theory 34 (2000) 142-153.