The SCEAS System
Navigation Menu

Search the dblp DataBase


David P. Day: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]

  7. On equality in an upper bound for the restrained and total domination numbers of a graph. [Citation Graph (, )][DBLP]

  8. Domination with exponential decay. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.004secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002