Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenda C. Swart
Person information
- affiliation: University of Cape Town, Department of Mathematics and Applied Mathematics, South Africa
- affiliation: University of KwaZulu-Natal, School of Mathematical and Statistical Sciences, Durban, South Africa
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2014
[j40]Peter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart:
A characterisation of eccentric sequences of maximal outerplanar graphs. Australas. J Comb. 58: 376- (2014)- 2012
- [j39]M. J. Morgan, Simon Mukwembi, Henda C. Swart:
A lower bound on the eccentric connectivity index of a graph. Discret. Appl. Math. 160(3): 248-258 (2012) - [j38]Peter Dankelmann
, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart:
Eccentric counts, connectivity and chordality. Inf. Process. Lett. 112(24): 944-947 (2012) - 2011
- [j37]Peter Dankelmann, Henda C. Swart, Paul van den Berg:
The number of edges in a bipartite graph of given radius. Discret. Math. 311(8-9): 690-698 (2011) - [j36]M. J. Morgan, Simon Mukwembi, Henda C. Swart:
On the eccentric connectivity index of a graph. Discret. Math. 311(13): 1229-1234 (2011) - 2009
- [j35]Peter Dankelmann, Ivan Gutman, Simon Mukwembi, Henda C. Swart:
On the degree distance of a graph. Discret. Appl. Math. 157(13): 2773-2777 (2009) - [j34]Peter Dankelmann, Ivan Gutman, Simon Mukwembi, Henda C. Swart:
The edge-Wiener index of a graph. Discret. Math. 309(10): 3452-3457 (2009) - [j33]Peter Dankelmann, David P. Day, David Erwin, Simon Mukwembi, Henda C. Swart:
Domination with exponential decay. Discret. Math. 309(19): 5877-5883 (2009) - [j32]Peter Dankelmann, Simon Mukwembi, Henda C. Swart:
Average distance and vertex-connectivity. J. Graph Theory 62(2): 157-177 (2009) - 2008
- [j31]Peter Dankelmann, Henda C. Swart, Paul van den Berg:
Diameter and inverse degree. Discret. Math. 308(5-6): 670-673 (2008) - [j30]Peter Dankelmann, Simon Mukwembi, Henda C. Swart:
Average Distance and Edge-Connectivity II. SIAM J. Discret. Math. 21(4): 1035-1052 (2008) - [j29]Peter Dankelmann, Simon Mukwembi, Henda C. Swart:
Average Distance and Edge-Connectivity I. SIAM J. Discret. Math. 22(1): 92-101 (2008) - 2007
- [j28]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. Discret. Math. 307(22): 2845-2852 (2007) - 2006
- [j27]Peter Dankelmann, Johannes H. Hattingh, Michael A. Henning, Henda C. Swart:
Trees with Equal Domination and Restrained Domination Numbers. J. Glob. Optim. 34(4): 597-607 (2006) - 2004
- [j26]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. Discret. Math. 281(1-3): 137-148 (2004) - 2003
- [j25]Gary Chartrand, Peter Dankelmann, Michelle Schultz, Henda C. Swart:
Twin Domination in Digraphs. Ars Comb. 67 (2003) - [j24]Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart:
MAD trees and distance-hereditary graphs. Discret. Appl. Math. 131(1): 151-167 (2003) - [j23]Peter Dankelmann, Henda C. Swart, David P. Day:
On strong distances in oriented graphs. Discret. Math. 266(1-3): 195-201 (2003) - 2002
- [j22]Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart:
Augmenting trees so that every three vertices lie on a cycle. Discret. Appl. Math. 116(1-2): 145-159 (2002) - 2001
- [j21]David P. Day, Wayne Goddard, Michael A. Henning, Henda C. Swart:
Multipartite Ramsey Numbers. Ars Comb. 58 (2001) - 1999
- [j20]Wayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart:
Bounds on the Total Redundance and Efficiency of a Graph. Ars Comb. 54 (1999) - [j19]David P. Day, Ortrud R. Oellermann, Henda C. Swart:
Bounds on the size of graphs of given order and up/down-connectivity. Discret. Math. 197-198: 217-223 (1999) - [j18]Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart:
Generalized eccentricity, radius, and diameter in graphs. Networks 34(4): 312-319 (1999) - 1998
- [j17]Peter Dankelmann, Vivienne Smithdorf, Henda C. Swart:
Radius-forcing sets in graphs. Australas. J Comb. 17: 39-50 (1998) - 1997
- [j16]Peter Dankelmann, Henda C. Swart, Ortrud Oellermann:
On the Average Steiner Distance of Graphs with Prescribed Properties. Discret. Appl. Math. 79(1-3): 91-103 (1997) - [j15]Wayne Goddard, Michael D. Plummer, Henda C. Swart:
Maximum and minimum toughness of graphs of small genus. Discret. Math. 167-168: 329-339 (1997) - [j14]David P. Day, Ortrud Oellermann, Henda C. Swart:
A characterization of 3-Steiner distance hereditary graphs. Networks 30(4): 243-253 (1997) - 1996
- [j13]Gerd Fricke, Michael A. Henning, Ortrud Oellermann, Henda C. Swart:
An Algorithm to Find Two Distance Domination Parameters in a Graph. Discret. Appl. Math. 68(1-2): 85-91 (1996) - [j12]Wayne Goddard, Henda C. Swart:
Distances between graphs under edge operations. Discret. Math. 161(1-3): 121-132 (1996) - [j11]Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart:
The diversity of domination. Discret. Math. 161(1-3): 161-173 (1996) - [j10]Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart:
Local edge domination critical graphs. Discret. Math. 161(1-3): 175-184 (1996) - [j9]Peter Dankelmann, Ortrud R. Oellermann, Henda C. Swart:
The average Steiner distance of a graph. J. Graph Theory 22(1): 15-22 (1996) - 1994
- [j8]Timothy J. Bean, Michael A. Henning, Henda C. Swart:
On the integrity of distance domination in graphs. Australas. J Comb. 10: 29-44 (1994) - [j7]David P. Day, Ortrud R. Oellermann, Henda C. Swart:
On the l-connectivity of a diagraph. Discret. Math. 127(1-3): 95-104 (1994) - [j6]Wayne Goddard, Ortrud R. Oellermann, Henda C. Swart:
Steiner distance stable graphs. Discret. Math. 132(1-3): 65-73 (1994) - [j5]David P. Day, Ortrud Oellermann, Henda C. Swart:
Steiner Distance-Hereditary Graphs. SIAM J. Discret. Math. 7(3): 437-442 (1994) - 1993
- [j4]Michael A. Henning, Henda C. Swart:
Bounds relating generalized domination parameters. Discret. Math. 120(1-3): 93-105 (1993) - [j3]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) - 1992
- [j2]Wayne Goddard, Michael A. Henning, Henda C. Swart:
Some nordhaus- gaddum-type results. J. Graph Theory 16(3): 221-231 (1992) - 1980
- [j1]Roger C. Entringer, Henda C. Swart:
Spanning cycles of nearly cubic graphs. J. Comb. Theory B 29(3): 303-309 (1980)
Coauthor Index
aka: Ortrud Oellermann
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 23:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
