
Search the dblp DataBase
David P. Day:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 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]
 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:13, pp:195201 [Journal]
 David P. Day, Ortrud Oellermann, Henda C. Swart
A characterization of 3Steiner distance hereditary graphs. [Citation Graph (0, 0)][DBLP] Networks, 1997, v:30, n:4, pp:243253 [Journal]
 David P. Day, Ortrud Oellermann, Henda C. Swart
Steiner DistanceHereditary Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1994, v:7, n:3, pp:437442 [Journal]
 David P. Day, Ortrud R. Oellermann, Henda C. Swart
Bounds on the size of graphs of given order and up/downconnectivity. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:197, n:, pp:217223 [Journal]
 David P. Day, Ortrud R. Oellermann, Henda C. Swart
On the lconnectivity of a diagraph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:127, n:13, pp:95104 [Journal]
On equality in an upper bound for the restrained and total domination numbers of a graph. [Citation Graph (, )][DBLP]
Domination with exponential decay. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
