Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Swart, Henda"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Eccentric counts, connectivity and chordality
Peter Dankelmann
,
David Erwin
,
Wayne Goddard
,
Simon Mukwembi
,
Henda C. Swart
Information Processing Letters
112
(24), 2012, pp. 944-947
Average distance and vertex-connectivity
Peter Dankelmann
,
Simon Mukwembi
,
Henda C. Swart
Journal of Graph Theory
62
(2), 2009, pp. 157-177
Average distance and edge-connectivity I
Peter Dankelmann
,
Simon Mukwembi
,
Henda C. Swart
SIAM Journal on Discrete Mathematics
22
(1), 2008, pp. 92-101
Average distance and edge-connectivity II
Peter Dankelmann
,
Simon Mukwembi
,
Henda C. Swart
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 1035-1052
Augmenting trees so that every three vertices lie on a cycle
Peter Dankelmann
,
Wayne Goddard
,
Ortrud R. Oellermann
,
Henda C. Swart
Discrete Applied Mathematics
116
(1-2), 2002, pp. 145-159
Generalized eccentricity, radius, and diameter in graphs
Peter Dankelmann
,
Wayne Goddard
,
Michael A. Henning
,
Henda C. Swart
Networks
34
(4), 1999, pp. 312-319
On the average Steiner distance of graphs with prescribed properties
Peter Dankelmann
,
Henda C. Swart
,
Ortrud R. Oellermann
Discrete Applied Mathematics
79
(1-3), 1997, pp. 91-103
A characterization of 3-Steiner distance hereditary graphs
D.P. Day
,
Ortrud R. Oellermann
,
Henda C. Swart
Networks
30
(4), 1997, pp. 243-253
The average Steiner distance of a graph
Peter Dankelmann
,
Ortrud R. Oellermann
,
Henda C. Swart
Journal of Graph Theory
22
(1), 1996, pp. 15-22
An algorithm to find two distance domination parameters in a graph
Gerd H. Fricke
,
Michael A. Henning
,
Ortrud R. Oellermann
,
Henda C. Swart
Discrete Applied Mathematics
68
(1-2), 1996, pp. 85-91
Steiner distance-hereditary graphs
D.P. Day
,
Ortrud R. Oellermann
,
Henda C. Swart
SIAM Journal on Discrete Mathematics
7
(3), 1994, August, pp. 437-442
Bounds relating generalized domination parameters
Michael A. Henning
,
Henda C. Swart
Discrete Mathematics
120
(1-3), 1993, pp. 93-105
Some Nordhaus-Gaddum-type results
Wayne Goddard
,
Michael A. Henning
,
Henda C. Swart
Journal of Graph Theory
16
(3), 1992, pp. 221-231
Spanning cycles of nearly cubic graphs
R.C. Entringer
,
Henda Swart
Journal of Combinatorial Theory Series B
29
(3), 1980, December, pp. 303-309