| 2007 |
|---|
| 7 | EE | 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) |
| 2003 |
|---|
| 6 | EE | Peter Dankelmann,
Henda C. Swart,
David P. Day:
On strong distances in oriented graphs.
Discrete Mathematics 266(1-3): 195-201 (2003) |
| 2001 |
|---|
| 5 | | David P. Day,
Wayne Goddard,
Michael A. Henning,
Henda C. Swart:
Multipartite Ramsey Numbers.
Ars Comb. 58: (2001) |
| 1999 |
|---|
| 4 | EE | 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) |
| 1997 |
|---|
| 3 | EE | David P. Day,
Ortrud Oellermann,
Henda C. Swart:
A characterization of 3-Steiner distance hereditary graphs.
Networks 30(4): 243-253 (1997) |
| 1994 |
|---|
| 2 | EE | David P. Day,
Ortrud R. Oellermann,
Henda C. Swart:
On the l-connectivity of a diagraph.
Discrete Mathematics 127(1-3): 95-104 (1994) |
| 1 | EE | David P. Day,
Ortrud Oellermann,
Henda C. Swart:
Steiner Distance-Hereditary Graphs.
SIAM J. Discrete Math. 7(3): 437-442 (1994) |
