Henda C. Swart

	2009
27		Peter Dankelmann, I. Gutman, Simon Mukwembi, Henda C. Swart: On the degree distance of a graph. Discrete Applied Mathematics 157(13): 2773-2777 (2009)
	2008
26		Peter Dankelmann, Henda C. Swart, Paul van den Berg: Diameter and inverse degree. Discrete Mathematics 308(5-6): 670-673 (2008)
25		Peter Dankelmann, Simon Mukwembi, Henda C. Swart: Average Distance and Edge-Connectivity II. SIAM J. Discrete Math. 21(4): 1035-1052 (2008)
24		Peter Dankelmann, Simon Mukwembi, Henda C. Swart: Average Distance and Edge-Connectivity I. SIAM J. Discrete Math. 22(1): 92-101 (2008)
	2007
23		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. Discrete Mathematics 307(22): 2845-2852 (2007)
	2004
22		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. Discrete Mathematics 281(1-3): 137-148 (2004)
	2003
21		Gary Chartrand, Peter Dankelmann, Michelle Schultz, Henda C. Swart: Twin Domination in Digraphs. Ars Comb. 67: (2003)
20		Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart: MAD trees and distance-hereditary graphs. Discrete Applied Mathematics 131(1): 151-167 (2003)
19		Peter Dankelmann, Henda C. Swart, David P. Day: On strong distances in oriented graphs. Discrete Mathematics 266(1-3): 195-201 (2003)
	2002
18		Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart: Augmenting trees so that every three vertices lie on a cycle. Discrete Applied Mathematics 116(1-2): 145-159 (2002)
	2001
17		David P. Day, Wayne Goddard, Michael A. Henning, Henda C. Swart: Multipartite Ramsey Numbers. Ars Comb. 58: (2001)
	1999
16		Wayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart: Bounds on the Total Redundance and Efficiency of a Graph. Ars Comb. 54: (1999)
15		David P. Day, Ortrud R. Oellermann, Henda C. Swart: Bounds on the size of graphs of given order and up/down-connectivity. Discrete Mathematics 197-198: 217-223 (1999)
14		Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart: Generalized eccentricity, radius, and diameter in graphs. Networks 34(4): 312-319 (1999)
	1997
13		Peter Dankelmann, Henda C. Swart, Ortrud Oellermann: On the Average Steiner Distance of Graphs with Prescribed Properties. Discrete Applied Mathematics 79(1-3): 91-103 (1997)
12		Wayne Goddard, Michael D. Plummer, Henda C. Swart: Maximum and minimum toughness of graphs of small genus. Discrete Mathematics 167-168: 329-339 (1997)
11		David P. Day, Ortrud Oellermann, Henda C. Swart: A characterization of 3-Steiner distance hereditary graphs. Networks 30(4): 243-253 (1997)
	1996
10		Gerd Fricke, Michael A. Henning, Ortrud Oellermann, Henda C. Swart: An Algorithm to Find Two Distance Domination Parameters in a Graph. Discrete Applied Mathematics 68(1-2): 85-91 (1996)
9		Wayne Goddard, Henda C. Swart: Distances between graphs under edge operations. Discrete Mathematics 161(1-3): 121-132 (1996)
8		Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart: The diversity of domination. Discrete Mathematics 161(1-3): 161-173 (1996)
7		Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart: Local edge domination critical graphs. Discrete Mathematics 161(1-3): 175-184 (1996)
	1994
6		David P. Day, Ortrud R. Oellermann, Henda C. Swart: On the l-connectivity of a diagraph. Discrete Mathematics 127(1-3): 95-104 (1994)
5		Wayne Goddard, Ortrud R. Oellermann, Henda C. Swart: Steiner distance stable graphs. Discrete Mathematics 132(1-3): 65-73 (1994)
4		David P. Day, Ortrud Oellermann, Henda C. Swart: Steiner Distance-Hereditary Graphs. SIAM J. Discrete Math. 7(3): 437-442 (1994)
	1993
3		Michael A. Henning, Henda C. Swart: Bounds relating generalized domination parameters. Discrete Mathematics 120(1-3): 93-105 (1993)
2		Gary Chartrand, Wayne Goddard, Michael A. Henning, Farrokh Saba, Henda C. Swart: Principal Common Divisors of Graphs. Eur. J. Comb. 14(2): 85-93 (1993)
	1980
1		Roger C. Entringer, Henda C. Swart: Spanning cycles of nearly cubic graphs. J. Comb. Theory, Ser. B 29(3): 303-309 (1980)

Coauthor Index

1	Paul van den Berg	[26]
2	Gary Chartrand	[2] [21]
3	Elias Dahlhaus	[20]
4	Peter Dankelmann	[13] [14] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27]
5	David P. Day	[4] [6] [11] [15] [17] [19] [23]
6	Gayla S. Domke	[22]
7	Roger C. Entringer	[1]
8	Gerd Fricke	[10]
9	Wayne Goddard	[2] [5] [9] [12] [14] [16] [17] [18] [20] [22]
10	Paul J. P. Grobler	[22]
11	I. Gutman	[27]
12	Johannes H. Hattingh	[22] [23]
13	Michael A. Henning	[2] [3] [7] [8] [10] [14] [17] [23]
14	Lisa R. Markus	[23]
15	Simon Mukwembi	[24] [25] [27]
16	Ortrud R. Oellermann (Ortrud Oellermann)	[4] [5] [6] [7] [8] [10] [11] [13] [15] [16] [18]
17	Michael D. Plummer	[12]
18	Farrokh Saba	[2]
19	Michelle Schultz	[21]
20	Peter J. Slater	[16]

Colors in the list of coauthors