|
Search the dblp DataBase
Henda C. Swart:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Gary Chartrand, Peter Dankelmann, Michelle Schultz, Henda C. Swart
Twin Domination in Digraphs. [Citation Graph (0, 0)][DBLP] Ars Comb., 2003, v:67, n:, pp:- [Journal]
- David P. Day, Wayne Goddard, Michael A. Henning, Henda C. Swart
Multipartite Ramsey Numbers. [Citation Graph (0, 0)][DBLP] Ars Comb., 2001, v:58, n:, pp:- [Journal]
- Wayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart
Bounds on the Total Redundance and Efficiency of a Graph. [Citation Graph (0, 0)][DBLP] Ars Comb., 1999, v:54, n:, pp:- [Journal]
- Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart
MAD trees and distance-hereditary graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:131, n:1, pp:151-167 [Journal]
- Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart
Augmenting trees so that every three vertices lie on a cycle. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:145-159 [Journal]
- Peter Dankelmann, Henda C. Swart, Ortrud Oellermann
On the Average Steiner Distance of Graphs with Prescribed Properties. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:91-103 [Journal]
- Gerd Fricke, Michael A. Henning, Ortrud Oellermann, Henda C. Swart
An Algorithm to Find Two Distance Domination Parameters in a Graph. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:68, n:1-2, pp:85-91 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:281, n:1-3, pp:137-148 [Journal]
- Peter Dankelmann, Henda C. Swart, David P. Day
On strong distances in oriented graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:266, n:1-3, pp:195-201 [Journal]
- Gary Chartrand, Wayne Goddard, Michael A. Henning, Farrokh Saba, Henda C. Swart
Principal Common Divisors of Graphs. [Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1993, v:14, n:2, pp:85-93 [Journal]
- Roger C. Entringer, Henda C. Swart
Spanning cycles of nearly cubic graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1980, v:29, n:3, pp:303-309 [Journal]
- Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart
Generalized eccentricity, radius, and diameter in graphs. [Citation Graph (0, 0)][DBLP] Networks, 1999, v:34, n:4, pp:312-319 [Journal]
- David P. Day, Ortrud Oellermann, Henda C. Swart
A characterization of 3-Steiner distance hereditary graphs. [Citation Graph (0, 0)][DBLP] Networks, 1997, v:30, n:4, pp:243-253 [Journal]
- David P. Day, Ortrud Oellermann, Henda C. Swart
Steiner Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1994, v:7, n:3, pp:437-442 [Journal]
- David P. Day, Ortrud R. Oellermann, Henda C. Swart
Bounds on the size of graphs of given order and up/down-connectivity. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:197, n:, pp:217-223 [Journal]
- Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart
Local edge domination critical graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:161, n:1-3, pp:175-184 [Journal]
- Wayne Goddard, Henda C. Swart
Distances between graphs under edge operations. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:161, n:1-3, pp:121-132 [Journal]
- Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart
The diversity of domination. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:161, n:1-3, pp:161-173 [Journal]
- Wayne Goddard, Michael D. Plummer, Henda C. Swart
Maximum and minimum toughness of graphs of small genus. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:167, n:, pp:329-339 [Journal]
- Michael A. Henning, Henda C. Swart
Bounds relating generalized domination parameters. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1993, v:120, n:1-3, pp:93-105 [Journal]
- Wayne Goddard, Ortrud R. Oellermann, Henda C. Swart
Steiner distance stable graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:132, n:1-3, pp:65-73 [Journal]
- David P. Day, Ortrud R. Oellermann, Henda C. Swart
On the l-connectivity of a diagraph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:127, n:1-3, pp:95-104 [Journal]
On the degree distance of a graph. [Citation Graph (, )][DBLP]
On equality in an upper bound for the restrained and total domination numbers of a graph. [Citation Graph (, )][DBLP]
Diameter and inverse degree. [Citation Graph (, )][DBLP]
Domination with exponential decay. [Citation Graph (, )][DBLP]
The edge-Wiener index of a graph. [Citation Graph (, )][DBLP]
Search in 0.034secs, Finished in 0.035secs
|