# Henda C Swart's publications

We list below all the publications by Henda C Swart that we have been able to find. If anyone knows of additional works, please let us know and we will add them to the list:
1. Roger C Entringer and Henda C Swart, Spanning cycles of nearly cubic graphs, J. Combin. Theory Ser. B 29 (3) (1980), 303-309.

2. Henda C Swart and Klaus Vedder, Subplane replacement in projective planes, Aequationes Math. 22 (2-3) (1981), 134-139.

3. Roger C Entringer, D E Jackson and Henda C Swart, Detours in digraphs, Proceedings of the Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing, Vol. I (Baton Rouge, La., 1981), Congr. Numer. 32 (1981), 305-321.

4. Paul A Winter and Henda C Swart, On alpha, beta destructible graphs, Quaestiones Math. 7 (2) (1984), 161-178.

5. Ortrud R Oellermann and Henda C Swart, Graphs for which all strong orientations are Eulerian, Exposition. Math. 2 (2) (1984), 183-184.

6. Paul A Winter and Henda C Swart, On stable graphs, Quaestiones Math. 7 (4) (1984), 397-405.

7. Paul A Winter and Henda C Swart, 2-3 graphs which have Vizing's adjacency property, Aequationes Math. 31 (1) (1986), 34-36.

8. Henda C Swart and Paul A Winter, The reconstruction of graphs from $m, n$-matroids, J. Combin. Inform. System Sci. 11 (2-4) (1986), 115-123.

9. C A Barefoot, Roger C Entringer and Henda C Swart, Vulnerability in graphs - a comparative survey. Proceedings of the first Carbondale combinatorics conference (Carbondale, Ill., 1986), J. Combin. Math. Combin. Comput. 1 (1987), 13-22.

10. Michael A Henning, Henda C Swart and Paul A Winter, On $(I, n)$-regular graphs, in Proceedings of the Singapore conference on combinatorial mathematics and computing (Singapore, 1986), Ars Combin. 23 A (1987), 141-152.

11. Gary Chartrand, Karen S Holbert, Ortrud R Oellermann and Henda C Swart, $F$-degrees in graphs, Ars Combin. 24 (1987), 133-148.

12. C A Barefoot, Roger C Entringer and Henda C Swart, Integrity of trees and powers of cycles. Eighteenth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, Fla., 1987), Congr. Numer. 58 (1987), 103-114.

13. Michael A Henning, Henda C Swart and Paul A Winter, On $(I^{*}, n)$-regular graphs, Quaestiones Math. 11 (1) (1988), 51-63.

14. Wayne D Goddard and Henda C Swart, On the integrity of combinations of graphs, J. Combin. Math. Combin. Comput. 4 (1988), 3-18.

15. Yousef Alavi, Paresh J Malde, Allen J Schwenk and Henda C Swart, Non-color-cyclic factorizations of complete graphs. 250th Anniversary Conference on Graph Theory (Fort Wayne, IN, 1986), Congr. Numer. 63 (1988), 201-212.

16. Gary Chartrand, Ortrud R Oellermann and Henda C Swart, Degree representative trees in graphs, 250th Anniversary Conference on Graph Theory (Fort Wayne, IN, 1986), Congr. Numer. 64 (1988), 73-79.

17. S F Kapoor, Bruce P Mull, Robert G Rieper and Henda C Swart, Generalized line-graphs: a Krausz characterization, Sci. Ser. A Math. Sci. (N.S.) 2 (1988), 75-82.

18. Michael A Henning and Henda C Swart, Bounds on a generalized total domination parameter, J. Combin. Math. Combin. Comput. 6 (1989), 143-153.

19. Yousef Alavi, Gary Chartrand, Don R Lick and Henda C Swart, Highly regular graphs, in Graph theory and its applications: East and West, Jinan, 1986, Ann. New York Acad. Sci. 576 (New York Acad. Sci., New York, 1989), 20-29.

20. Wayne Goddard and Henda C Swart, Integrity in graphs: bounds and basics, J. Combin. Math. Combin. Comput. 7 (1990), 139-151.

21. Wayne D Goddard and Henda C Swart, On the toughness of a graph, Quaestiones Math. 13 (2) (1990), 217-232.

22. Michael A Henning and Henda C Swart, Bounds on a generalized domination parameter, Quaestiones Math. 13 (2) (1990), 237-257.

23. Wayne Goddard, Ortrud R Oellermann and Henda C Swart, A new approach to distance stable graphs, J. Combin. Math. Combin. Comput. 8 (1990), 209-220.

24. O R Oellermann and Henda C Swart, On the Steiner periphery and Steiner eccentricity of a graph, in Topics in combinatorics and graph theory, Oberwolfach, 1990 (Physica, Heidelberg, 1990), 541-547.

25. Gary Chartrand, Wayne Goddard, Michael A Henning, Linda Lesniak, Henda C Swart and Curtiss E Wall, Which graphs are distance graphs?, Twelfth British Combinatorial Conference (Norwich, 1989), Ars Combin. 29 A (1990), 225-232.

26. Michael A Henning, Ortrud R Oellermann and Henda C Swart, On the Steiner radius and Steiner diameter of a graph, Twelfth British Combinatorial Conference (Norwich, 1989), Ars Combin. 29 C (1990), 13-19.

27. Michael A Henning, Ortrud R Oellermann and Henda C Swart, On vertices with maximum Steiner [eccentricity in graphs], in Graph theory, combinatorics, algorithms, and applications, San Francisco, CA, 1989 (SIAM, Philadelphia, PA, 1991), 393-403.

28. David P Day, Ortrud R Oellermann and Henda C Swart, On the l-connectivity function of caterpillars and complete multipartite graphs, J. Combin. Math. Combin. Comput. 10 (1991), 183-192.

29. Wayne D Goddard and Henda C Swart, On some extremal problems in connectivity, in Graph theory, combinatorics, and applications, Vol. 1, Kalamazoo, MI, 1988 (Wiley-Intersci. Publ., Wiley, New York, 1991), 535-551.

30. Michael A Henning, Henda C Swart and Paul A Winter, On graphs with $(I, n)$-regular induced subgraphs, in Graph theory, combinatorics, and applications. Vol. 2, Kalamazoo, MI, 1988 (Wiley-Intersci. Publ., Wiley, New York, 1991), 645-650.

31. Michael A Henning, Ortrud R Oellermann and Henda C Swart, Bounds on distance domination parameters, J. Combin. Inform. System Sci. 16 (1) (1991), 11-18.

32. Wayne Goddard, Michael A Henning and Henda C Swart, Some Nordhaus-Gaddum-type results, J. Graph Theory 16 (3) (1992), 221-231.

33. Wayne Goddard and Henda C Swart, Two results on the binding numbers of product graphs, Ars Combin. 34 (1992), 119-128.

34. Gary Chartrand, Wayne Goddard, Michael A Henning, Farrokh Saba and Henda C Swart, Principal common divisors of graphs, European J. Combin. 14 (2) (1993), 85-93.

35. Michael A Henning and Henda C Swart, Bounds relating generalized domination parameters, Discrete Math. 120 (1-3) (1993), 93-105.

36. Wayne Goddard, Michael A Henning, Ortrud R Oellermann and Henda C Swart, Which trees are uniquely framed by the Heawood graph?, Quaestiones Math. 16 (3) (1993), 237-251.

37. Wayne Goddard, Michael A Henning, Ortrud R Oellermann and Henda C Swart, Some general aspects of the framing number of a graph, Quaestiones Math. 16 (3) (1993), 289-300.

38. Paul Erdös, Michael A Henning and Henda C Swart, The smallest order of a graph with domination number equal to two and with every vertex contained in a K_n, Ars Combin. 35 A (1993), 217-223.

39. David P Day, Ortrud R Oellermann and Henda C Swart, On the l-connectivity of a digraph, in Graph theory and applications, Hakone, 1990, Discrete Math. 127 (1-3) (1994), 95-104.

40. Michael A Henning, Ortrud R Oellermann and Henda C Swart, Relationships between distance domination parameters, Math. Pannon. 5 (1) (1994), 67-77.

41. David P Day, Ortrud R Oellermann and Henda C Swart, Steiner distance-hereditary graphs, SIAM J. Discrete Math. 7 (3) (1994), 437-442.

42. Michael A Henning and Henda C Swart, On a conjecture on $n$th order degree regular graphs, Quaestiones Math. 17 (3) (1994), 339-348.

43. Timothy J Bean, Michael A Henning and Henda C Swart, On the integrity of distance domination in graphs, Australas. J. Combin. 10 (1994), 29-43.

44. Wayne Goddard, Ortrud R Oellermann and Henda C Swart, Steiner distance stable graphs, Discrete Math. 132 (1-3) (1994), 65-73.

45. Michael A Henning, Ortrud R Oellermann and Henda C Swart, Relating pairs of distance domination parameters, J. Combin. Math. Combin. Comput. 18 (1995), 233-244.

46. Michael A Henning and Henda C Swart, On nth order degree regular trees, Indian J. Pure Appl. Math. 26 (8) (1995), 777-786.

47. Michael A Henning, Ortrud R Oellermann and Henda C Swart, Uniquely Steiner-eccentric graphs, in Graph theory, combinatorics, and algorithms, Vol. 1, 2, Kalamazoo, MI, 1992 (Wiley-Intersci. Publ., Wiley, New York, 1995), 1123-1134.

48. Peter Dankelmann, Ortrud R Oellermann and Henda C Swart, The average Steiner distance of a graph, J. Graph Theory 22 (1) (1996), 15-22.

49. Gerd H Fricke, Michael A Henning, Ortrud R Oellermann and Henda C Swart, An algorithm to find two distance domination parameters in a graph, Discrete Appl. Math. 68 (1-2) (1996), 85-91.

50. Wayne Goddard and Henda C Swart, Distances between graphs under edge operations, Discrete Math. 161 (1-3) (1996), 121-132.

51. Michael A Henning, Ortrud R Oellermann and Henda C Swart, The diversity of domination, Discrete Math. 161 (1-3) (1996), 161-173.

52. Michael A Henning, Ortrud R Oellermann and Henda C Swart, Local edge domination critical graphs, Discrete Math. 161 (1-3) (1996), 175-184.

53. Wayne Goddard, Michael D Plummer and Henda C Swart, Maximum and minimum toughness of graphs of small genus, 15th British Combinatorial Conference (Stirling, 1995), Discrete Math. 167/168 (1997), 329-339.

54. Peter Dankelmann, Henda C Swart and Ortrud R Oellermann, On the average Steiner distance of graphs with prescribed properties, 4th Twente Workshop on Graphs and Combinatorial Optimization (Enschede, 1995), Discrete Appl. Math. 79 (1-3) (1997), 91-103.

55. David P Day, Ortrud R Oellermann and Henda C Swart, A characterization of 3-Steiner distance hereditary graphs, Networks 30 (4) (1997), 243-253.

56. Peter Dankelmann, Henda C Swart and Ortrud R Oellermann, On three conjectures of GRAFFITI, J. Combin. Math. Combin. Comput. 26 (1998), 131-137.

57. Peter Dankelmann, Vivienne Smithdorf and Henda C Swart, Radius-forcing sets in graphs, Australas. J. Combin. 17 (1998), 39-49.

58. David P Day, Ortrud R Oellermann and Henda C Swart, Bounds on the size of graphs of given order and l-connectivity, 16th British Combinatorial Conference (London, 1997), Discrete Math. 197/198 (1999), 217-223.

59. Peter Dankelmann, Wayne Goddard, Michael A Henning and Henda C Swart, Generalized eccentricity, radius, and diameter in graphs. Centrality concepts in network location, Networks 34 (4) (1999), 312-319.

60. Peter Dankelmann, Henda C Swart and Ortrud R Oellermann, Bounds on the Steiner diameter of a graph, in Combinatorics, graph theory, and algorithms, Vol. I, II, Kalamazoo, MI, 1996 (New Issues Press, Kalamazoo, MI, 1999), 269-279.

61. Wayne Goddard, Ortrud R Oellermann, Peter J Slater and Henda C Swart, Bounds on the total redundance and efficiency of a graph, Ars Combin. 54 (2000), 129-138.

62. David Day, Wayne Goddard, Michael A Henning and Henda C Swart, Multipartite Ramsey numbers, Ars Combin. 58 (2001), 23-31.

63. Peter Dankelmann, David J Erwin, G Fricke, Wayne Goddard and Henda C Swart, Minimal and maximal $e = 1$ functions, J. Combin. Math. Combin. Comput. 36 (2001), 127-138.

64. Gary Chartrand, Frank Harary, Henda C Swart and Ping Zhang, Geodomination in graphs, Bull. Inst. Combin. Appl. 31 (2001), 51-59.

65. Peter Dankelmann, Wayne Goddard, Ortrud R Oellermann and Henda C Swart, Augmenting trees so that every three vertices lie on a cycle, Discrete Appl. Math. 116 (1-2) (2002), 145-159.

66. Michael A Henning, Ortrud R Oellermann and Henda C Swart, Distance domination critical graphs, J. Combin. Math. Combin. Comput. 44 (2003), 33-45.

67. Gary Chartrand, Peter Dankelmann, Michelle Schultz and Henda C Swart, Twin domination in digraphs, Ars Combin. 67 (2003), 105-114.

68. Peter Dankelmann, Henda C Swart, David P Day, On strong distances in oriented graphs, The 18th British Combinatorial Conference (Brighton, 2001), Discrete Math. 266 (1-3) (2003), 195-201.

69. E Dahlhaus, Peter Dankelmann, Wayne Goddard and Henda C Swart, MAD trees and distance-hereditary graphs, The Second International Colloquium "Journées de l'Informatique Messine'' (Metz, 2000), Discrete Appl. Math. 131 (1) (2003), 151-167.

70. Peter Dankelmann, Gayla S Domke, Wayne Goddard, Paul Grobler, Johannes H Hattingh and Henda C Swart, Maximum sizes of graphs with given domination parameters, Discrete Math. 281 (1-3) (2004), 137-148.

71. Peter Dankelmann, Gcina Dlamini and Henda C Swart, Upper bounds on distance measures in $K_{\{3,3\}}$-free graphs, Util. Math. 67 (2005), 205-221.

72. C M Mynhardt, Henda C Swart and E Ungerer, Excellent trees and secure domination, Util. Math. 67 (2005), 255-267.

73. Wayne Goddard, Christine S Swart and Henda C Swart, On the graphs with maximum distance or $k$-diameter, Math. Slovaca 55 (2) (2005), 131-139.

74. Peter Dankelmann, Johannes H Hattingh, Michael A Henning and Henda C Swart, Trees with equal domination and restrained domination numbers, J. Global Optim. 34 (4) (2006), 597-607.

75. Peter Dankelmann, Simon Mukwembi and Henda C Swart, An upper bound on the radius of a 3-edge-connected graph, Util. Math. 73 (2007), 207-215.

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

77. Peter Dankelmann, Simon Mukwembi and Henda C Swart, Average distance and edge-connectivity. II, SIAM J. Discrete Math. 21 (4) (2007), 1035-1052.

78. Peter Dankelmann, Henda C Swart and Paul van den Berg, Diameter and inverse degree, Discrete Math. 308 (5-6) (2008), 670-673.

79. Peter Dankelmann, Simon Mukwembi and Henda C Swart, Average distance and edge-connectivity. I, SIAM J. Discrete Math. 22 (1) (2008), 92-101.

80. Peter Dankelmann, Henda C Swart, Paul van den Berg, Wayne Goddard, M D Plummer, Minimal claw-free graphs, Czechoslovak Math. J. 58(133) (3) (2008), 787-798.

81. Peter Dankelmann, I Gutman, Simon Mukwembi and Henda C Swart, The edge-Wiener index of a graph, Discrete Math. 309 (10) (2009), 3452-3457.

82. Peter Dankelmann, I Gutman, Simon Mukwembi and Henda C Swart, On the degree distance of a graph, Discrete Appl. Math. 157 (13) (2009), 2773-2777.

83. Peter Dankelmann, David P Day, David Erwin, Simon Mukwembi and Henda C Swart, Domination with exponential decay, Discrete Math. 309 (19) (2009), 5877-5883.

84. Peter Dankelmann, Simon Mukwembi and Henda C Swart, Average distance and vertex-connectivity, J. Graph Theory 62 (2) (2009), 157-177.

85. Peter Dankelmann, Henda C Swart and Paul van den Berg, The number of edges in a bipartite graph of given radius, Discrete Math. 311 (8-9) (2011), 690-698.

86. Megan J Morgan, Simon Mukwembi and Henda C Swart, On the eccentric connectivity index of a graph, Discrete Math. 311 (13) (2011), 1229-1234.

87. Megan J Morgan, Simon Mukwembi and Henda C Swart, A lower bound on the eccentric connectivity index of a graph, Discrete Appl. Math. 160 (3) (2012), 248-258.

88. Peter Dankelmann, David J Erwin, Wayne Goddard, Simon Mukwembi and Henda C Swart, Eccentric counts, connectivity and chordality, Inform. Process. Lett. 112 (24) (2012), 944-947.

89. Peter Dankelmann, Wayne Goddard, Charles A McPillan and Henda C Swart, A note on extremal values of the scattering number, Taiwanese J. Math. 17 (5) (2013), 1651-1658.

90. Peter Dankelmann, Megan J Morgan, Simon Mukwembi and Henda C Swart, On the eccentric connectivity index and Wiener index of a graph, Quaest. Math. 37 (1) (2014), 39-47.

91. Peter Dankelmann, David J Erwin, Wayne Goddard, Simon Mukwembi and Henda C Swart, A characterisation of eccentric sequences of maximal outerplanar graphs, Australas. J. Combin. 58 (2014), 376-391.

92. Megan J Morgan, Simon Mukwembi and Henda C Swart, Extremal regular graphs for the eccentric connectivity index, Quaest. Math. 37 (3) (2014), 435-444.

93. Megan J Morgan, Simon Mukwembi and Henda C Swart, On a conjecture by Tomescu, Util. Math. 102 (2017), 87-104.

94. Peter Dankelmann, David J Erwin and Henda C Swart, On digraphs with prescribed eccentricities, J. Combin. Math. Combin. Comput. 104 (2018), 143-160.

95. Patrick Ali, Peter Dankelmann, Megan J Morgan, Simon Mukwembi, Henda C Swart and Tomás Vetrík, The average eccentricity, spanning trees of plane graphs, size and order, Util. Math. 107 (2018), 37-49.

Last Updated March 2019