Positions

Selected Publications

Academic Article

Year Title Altmetric
2018-05-01 Some multicolor bipartite Ramsey numbers involving cycles and a small number of colorsDiscrete Mathematics.  341:1325-1330. 2018-05-01
2018-01-01 Further results on total $k$-subdominating functions in treesJ. Combin. Math. Combin. Comput..  104:65. 2018-01-01
2018-01-01 Further results on total k-subdominating function in treesJournal of Combinatorial Mathematics and Combinatorial Computing.  104:65-73. 2018-01-01
2018-01-01 The product of the total restrained domination numbers of a graph and its complementAustralasian Journal of Combinatorics.  70:297-308. 2018-01-01
2017-01-01 Total domination in maximal outerplanar graphsDiscrete Appl. Math..  217:506. 2017-01-01
2017-01-01 Total domination in maximal outerplanar graphs IDiscrete Applied Mathematics.  217:506-511. 2017-01-01
2016-10-01 The Effectiveness of the North Carolina Early Mathematics Placement Test In Preparing High School Students for College-Level Introductory Mathematics CoursesCollege Student Journal.  50:369-377. 2016-10-01
2016-05-01 Equality in a bound that relates the size and the restrained domination number of a graphJournal of Combinatorial Optimization.  31:1586-1608. 2016-05-01
2016-05-01 Product Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolatesGraphs and Combinatorics.  32:987-996. 2016-05-01
2016-03-01 Total domination in maximal outerplanar graphs IIDiscrete Mathematics.  339:1180-1188. 2016-03-01
2016-01-01 Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolatesGraphs Combin..  32:987. 2016-01-01
2014-09-01 Some bistar bipartite Ramsey NumbersGraphs and Combinatorics.  30:1175-1181. 2014-09-01
2014-03-01 The mixed irredundant Ramsey numbers t(3,7)=18 and t(3,8)=22Quaestiones Mathematicae.  37:571-589. 2014-03-01
2014-02-01 The product of the restrained domination numbers of a graph and its complementActa Mathematica Sinica.  30:445-452. 2014-02-01
2014-01-01 Product Nordhaus-Gaddum type results for the induced path number with relative complements in K_n or K_{n,n}Utilitas Mathematica.  94:275-285. 2014-01-01
2014-01-01 Product Nordhaus-Gaddum-type results for the induced path number involving complements with respect to $K_n$ or $K_{n,n}$Util. Math..  94:275. 2014-01-01
2013-01-01 Nordhaus-Gaddum type results for the induced path number with relative complements in $K_{m,n}$J. Combin. Math. Combin. Comput..  85:365. 2013-01-01
2012-01-01 A Nordhaus-Gaddum-type result for the induced path numberJ. Comb. Optim..  24:329. 2012-01-01
2012-01-01 Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complementActa Math. Sin. (Engl. Ser.).  28:2365. 2012-01-01
2012-01-01 The criticality index of total domination of a pathUtil. Math..  87:285. 2012-01-01
2012-01-01 Total edge critical graphs with leavesDiscrete Math..  312:3482. 2012-01-01
2011-01-01 Restrained domination in cubic graphsJ. Comb. Optim..  22:166. 2011-01-01
2010-01-01 A note on restrained domination in treesArs Combin..  94:477. 2010-01-01
2010-01-01 A note on the total outer-connected domination number of a treeAKCE Int. J. Graphs Comb..  7:223. 2010-01-01
2010-01-01 An upper bound on the total restrained domination number of a treeJ. Comb. Optim..  20:205. 2010-01-01
2010-01-01 Bounds on the total restrained domination number of a graphGraphs Combin..  26:77. 2010-01-01
2010-01-01 Restrained and total restrained domination in graphsNot. S. Afr. Math. Soc..  41:2. 2010-01-01
2010-01-01 Total restrained domination in unicyclic graphsUtil. Math..  82:81. 2010-01-01
2009-01-01 A characterization of $\lambda_{d,1}$-minimal trees and other attainable classesDiscrete Math..  309:2340. 2009-01-01
2009-01-01 A class of full $(d,1)$-colorable treesAustralas. J. Combin..  45:277. 2009-01-01
2009-01-01 An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degreeDiscrete Appl. Math..  157:2846. 2009-01-01
2009-01-01 Bounds relating the weakly connected domination number to the total domination number and the matching numberDiscrete Appl. Math..  157:3086. 2009-01-01
2009-01-01 Restrained domination in claw-free graphs with minimum degree at least twoGraphs Combin..  25:693. 2009-01-01
2009-01-01 Restrained domination in unicyclic graphsDiscuss. Math. Graph Theory.  29:71. 2009-01-01
2009-01-01 Vertex and edge critical total restrained domination in graphsBull. Inst. Combin. Appl..  57:107. 2009-01-01
2008-01-01 A note on the weakly connected domination subdivision number of a graphBull. Inst. Combin. Appl..  53:99. 2008-01-01
2008-01-01 Nordhaus-Gaddum results for restrained domination and total restrained domination in graphsDiscrete Math..  308:1080. 2008-01-01
2008-01-01 On the domination number of Hamiltonian graphs with minimum degree sixAppl. Math. Lett..  21:1037. 2008-01-01
2008-01-01 Restrained bondage in graphsDiscrete Math..  308:5446. 2008-01-01
2008-01-01 Restrained domination excellent treesArs Combin..  87:337. 2008-01-01
2007-01-01 On equality in an upper bound for the restrained and total domination numbers of a graphDiscrete Math..  307:2845. 2007-01-01
2007-01-01 Total restrained domination in treesDiscrete Math..  307:1643. 2007-01-01
2006-01-01 Algorithmic aspects of minus total $k$-subdomination in graphsAustralas. J. Combin..  36:101. 2006-01-01
2006-01-01 Algorithmic aspects of total $k$-subdomination in graphsDiscuss. Math. Graph Theory.  26:5. 2006-01-01
2006-01-01 The $L(d,1)$-hole index of paths and cyclesUtil. Math..  69:55. 2006-01-01
2006-01-01 Total $k$-subdominating functions on graphsAustralas. J. Combin..  35:141. 2006-01-01
2006-01-01 Trees with equal domination and restrained domination numbersJ. Global Optim..  34:597. 2006-01-01
2005-01-01 Augmenting a graph of minimum degree 2 to have two disjoint total dominating setsDiscrete Math..  300:82. 2005-01-01
2005-01-01 On weakly connected domination in graphs. IIDiscrete Math..  305:112. 2005-01-01
2004-01-01 Augmenting trees to have two disjoint total dominating setsBull. Inst. Combin. Appl..  42:12. 2004-01-01
2004-01-01 Maximum sizes of graphs with given domination parametersDiscrete Math..  281:137. 2004-01-01
2004-01-01 The algorithmic complexity of certain functional variations of total domination in graphsAustralas. J. Combin..  29:143. 2004-01-01
2003-01-01 Graphs with small upper line-distinguishing and upper harmonious chromatic numbersJ. Combin. Math. Combin. Comput..  47:165. 2003-01-01
2003-01-01 Upper line-distinguishing and upper harmonious chromatic numbers of cyclesJ. Combin. Math. Combin. Comput..  45:137. 2003-01-01
2002-01-01 Further results on weak domination in graphsUtil. Math..  61:193. 2002-01-01
2002-01-01 On parameters related to strong and weak domination in graphsDiscrete Math..  258:1. 2002-01-01
2001-01-01 The signed and minus $k$-subdomination numbers of certain complete multipartite graphs and their complementsUtil. Math..  59:77. 2001-01-01
2000-01-01 Characterizations of trees with equal domination parametersJ. Graph Theory.  34:142. 2000-01-01
2000-01-01 Restrained domination in graphs with minimum degree twoJ. Combin. Math. Combin. Comput..  35:239. 2000-01-01
2000-01-01 Restrained domination in treesDiscrete Math..  211:1. 2000-01-01
1999-01-01 Domination using induced cliques in graphsArs Combin..  52:129. 1999-01-01
1999-01-01 Restrained domination in graphsDiscrete Math..  203:61. 1999-01-01
1998-01-01 Bipartite Ramsey theoryUtil. Math..  53:217. 1998-01-01
1998-01-01 Distance irredundance in graphs: complexity issuesArs Combin..  50:3. 1998-01-01
1998-01-01 Minus $k$-subdomination in graphsArs Combin..  50:177. 1998-01-01
1998-01-01 Minus $k$-subdomination in graphs. IIIAustralas. J. Combin..  17:69. 1998-01-01
1998-01-01 On strong domination in graphsJ. Combin. Math. Combin. Comput..  26:73. 1998-01-01
1998-01-01 On weak domination in graphsArs Combin..  49:205. 1998-01-01
1998-01-01 Partial signed domination in graphsArs Combin..  48:33. 1998-01-01
1998-01-01 Star-path bipartite Ramsey numbersDiscrete Math..  185:255. 1998-01-01
1998-01-01 The signed and minus $k$-subdomination numbers of cometsDiscrete Math..  183:141. 1998-01-01
1997-01-01 Efficient coverage of edge sets in graphsUtil. Math..  51:183. 1997-01-01
1997-01-01 Minus $k$-subdomination in graphs. IIDiscrete Math..  171:141. 1997-01-01
1997-01-01 Using maximality and minimality conditions to construct inequality chainsDiscrete Math..  176:43. 1997-01-01
1995-01-01 The algorithmic complexity of signed domination in graphsAustralas. J. Combin..  12:101. 1995-01-01
1994-01-01 The ratio of the distance irredundance and domination numbers of a graphJ. Graph Theory.  18:1. 1994-01-01
1994-01-01 Three-valued $k$-neighborhood domination in graphsAustralas. J. Combin..  9:233. 1994-01-01
1993-01-01 A characterization of block graphs that are well-$k$-dominatedJ. Combin. Math. Combin. Comput..  13:33. 1993-01-01
1993-01-01 Asymptotic bounds for irredundant Ramsey numbersQuaestiones Math..  16:319. 1993-01-01
1993-01-01 Asymptotic bounds for irredundant and mixed Ramsey numbersJ. Graph Theory.  17:193. 1993-01-01
1993-01-01 On the computational complexity of upper distance fractional dominationAustralas. J. Combin..  7:133. 1993-01-01
1993-01-01 Structure graphs and structure graph grammarsInform. Sci..  73:235. 1993-01-01
1992-01-01 The irredundant Ramsey number $s(4,4)$Utilitas Math..  41:119. 1992-01-01
1991-01-01 The chromatic index of an abelian Cayley graphArs Combin..  31:312. 1991-01-01
1991-01-01 The irredundant Ramsey number $s(3,7)$Utilitas Math..  39:145. 1991-01-01
1990-01-01 On irredundant Ramsey numbers for graphsJ. Graph Theory.  14:437. 1990-01-01
1990-01-01 Products of circulant graphsQuaestiones Math..  13:191. 1990-01-01

Chapter

Year Title Altmetric
2020-10-01 Restrained and Total Restrained Domination in Graphs -- Topics in Domination in Graphs. Developments in Mathematics.  Springer, Cham. 129. 2020-10-01
2000-01-01 On the number of edges in a graph with given domination-type parameters.  J. Combin. Math. Combin. Comput.. 23. 2000-01-01
1999-01-01 On harmonious and related colorings of graphs -- Paul Erd\Hos and his mathematics (Budapest, 1999).  J\'anos Bolyai Math. Soc., Budapest. 50. 1999-01-01
1999-01-01 On the signed $k$-subdomination number of trees -- Combinatorics, graph theory, and algorithms, Vol. I, II (Kalamazoo, MI, 1996).  New Issues Press, Kalamazoo, MI. 479. 1999-01-01
1999-01-01 On the upper line-distinguishing and upper harmonious chromatic numbers of a graph.  J. Combin. Math. Combin. Comput.. 227. 1999-01-01
1999-01-01 The minus bondage number of a graph -- Combinatorics, graph theory, and algorithms, Vol. I, II (Kalamazoo, MI, 1996).  New Issues Press, Kalamazoo, MI. 491. 1999-01-01
1998-01-01 Majority domination and its generalizations -- Domination in graphs.  Dekker, New York. 91. 1998-01-01
1997-01-01 On weakly connected domination in graphs.  Discrete Math.. 261. 1997-01-01
1995-01-01 Distance irredundance in graphs -- Graph theory, combinatorics, and algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992).  Wiley, New York. 529. 1995-01-01
1995-01-01 Majority domination in graphs.  Discrete Math.. 125. 1995-01-01
1995-01-01 On the construction of self-complementary circulant graphs -- Graph theory, combinatorics, and algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992).  Wiley, New York. 123. 1995-01-01
1990-01-01 Mixed Ramsey numbers and irredundant Tur\'an numbers for graphs.  Ars Combin.. 57. 1990-01-01

Full Name

  • Johannes H Hattingh