The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ortrud R. Oellermann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Peter Dankelmann, Ortrud R. Oellermann
    Degree Sequences of Optimally Edge-Connected Multigraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:77, n:, pp:- [Journal]
  2. Ortrud R. Oellermann, Joel Peters-Fransen
    The strong metric dimension of graphs and digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:3, pp:356-364 [Journal]
  3. José Cáceres, Alberto Márquez, Ortrud R. Oellermann, María Luz Puertas
    Rebuilding convex sets in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:26-37 [Journal]
  4. Melodie Fehr, Shonda Gosselin, Ortrud R. Oellermann
    The metric dimension of Cayley digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:31-41 [Journal]
  5. Wayne Goddard, Michael A. Henning, Ortrud R. Oellermann
    Bipartite Ramsey numbers and Zarankiewicz numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:85-95 [Journal]
  6. Ortrud R. Oellermann, María Luz Puertas
    Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:1, pp:88-96 [Journal]
  7. Wayne Goddard, Grzegorz Kubicki, Ortrud R. Oellermann, Songlin Tian
    On multipartite tournaments. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:2, pp:284-300 [Journal]
  8. Yousef Alavi, Gary Chartrand, Ortrud R. Oellermann, Linda M. Lesniak
    Bipartite regulation numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:2, pp:113-118 [Journal]
  9. Ortrud R. Oellermann
    The connected cutset connectivity of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:3, pp:301-308 [Journal]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]

  15. The Metric Dimension of Cayley Digraphs of Abelian Groups. [Citation Graph (, )][DBLP]


  16. Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs. [Citation Graph (, )][DBLP]


  17. On 3-Steiner simplicial orderings. [Citation Graph (, )][DBLP]


  18. Traceability of k-traceable oriented graphs. [Citation Graph (, )][DBLP]


  19. Local Steiner convexity. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
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 asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002