#61,603

Most Influential Person

South African mathematician

According to Wikipedia, Ortrud R. Oellermann is a South African mathematician specializing in graph theory. She is a professor of mathematics at the University of Winnipeg. Education and career Oellermann was born in Vryheid. She earned a bachelor's degree, cum laude honours, and a master's degree at the University of Natal in 1981, 1982, and 1983 respectively, as a student of Henda Swart. She completed her Ph.D. in 1986 at Western Michigan University. Her dissertation was Generalized Connectivity in Graphs and was supervised by Gary Chartrand.

- Resolvability in graphs and the metric dimension of a graph (2000) (729)
- The strong metric dimension of graphs and digraphs (2007) (125)
- How to Define an Irregular Graph (1988) (97)
- The metric dimension of Cayley digraphs (2006) (93)
- The average connectivity of a graph (2002) (92)
- Steiner distance in graphs (1989) (87)
- Highly irregular graphs (1987) (80)
- The average Steiner distance of a graph (1996) (56)
- On the strong metric dimension of Cartesian and direct products of graphs (2013) (49)
- Rebuilding convex sets in graphs (2005) (48)
- Steiner centers in graphs (1990) (45)
- The partition dimension of Cayley digraphs (2006) (43)
- On the Average Steiner Distance of Graphs with Prescribed Properties (1997) (42)
- Steiner Distance-Hereditary Graphs (1994) (39)
- On Peripheral Vertices in Graphs (1990) (39)
- Bipartite Ramsey numbers and Zarankiewicz numbers (2000) (33)
- Metric-Locating-Dominating Sets in Graphs (2004) (32)
- On multipartite tournaments (1991) (27)
- Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs (2007) (27)
- Distance in Graphs (2011) (27)
- Bounds on the average connectivity of a graph (2003) (26)
- On thel-connectivity of a graph (1987) (26)
- Steiner Intervals in Graphs (1998) (26)
- Steiner Trees and Convex Geometries (2009) (24)
- The simultaneous metric dimension of graph families (2015) (23)
- On Steiner centers and Steiner medians of graphs (1999) (23)
- The directed path partition conjecture (2005) (23)
- An Eulerian exposition (1986) (21)
- Graph theory, combinatorics, and applications : proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs, Western Michigan University (1991) (21)
- Maximizing the mean subtree order (2017) (21)
- Generalized Connectivity in Graphs (1986) (20)
- on the Steiner Median of a Tree (1996) (20)
- The diversity of domination (1996) (19)
- A Traceability Conjecture for Oriented Graphs (2008) (16)
- K-PATH IRREGULAR GRAPHS (2005) (15)
- The average connectivity of a digraph (2004) (15)
- Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs (2008) (15)
- Bipartite rainbow Ramsey numbers (2004) (15)
- Minimum average distance of strong orientations of graphs (2004) (15)
- From steiner centers to steiner medians (1995) (15)
- On 3-Steiner simplicial orderings (2009) (14)
- Traceability of k-traceable oriented graphs (2010) (13)
- Graph theory, combinatorics, and applications (2017) (13)
- Global cycle properties in locally connected, locally traceable and locally hamiltonian graphs (2016) (12)
- Local Steiner convexity (2009) (11)
- Steiner distance stable graphs (1994) (11)
- Simultaneous Resolvability in Graph Families (2014) (11)
- On upper domination Ramsey numbers for graphs (2004) (10)
- On the mean connected induced subgraph order of cographs (2017) (10)
- The Irregularity Cost of a Graph (1997) (10)
- The threshold dimension of a graph (2020) (9)
- Minimal trees and monophonic convexity (2012) (9)
- The irregularity cost or sum of a graph (1993) (8)
- Relationships between distance domination parameters. (1994) (8)
- Bounds on the size of graphs of given order and e -connectivity (1999) (8)
- The upper domination Ramsey number u(3, 3, 3) (2002) (7)
- Bounds on the Total Redundance and Efficiency of a Graph (1999) (6)
- The Metric Dimension of Cayley Digraphs of Abelian Groups (2006) (6)
- Global cycle properties of locally isometric graphs (2015) (6)
- Conditional graph connectivity relative to hereditary properties (1991) (6)
- Steiner Numbers in Graphs (1990) (6)
- The average connectivity of regular multipartite tournaments (2001) (6)
- Local edge domination critical graphs (1996) (6)
- On the mean order of connected induced subgraphs of block graphs (2018) (6)
- WHICH TREES ARE UNIQUELY FRAMED BY THE HEAWOOD GRAPH (1993) (6)
- Connected graphs containing a given connected graph as a unique greatest common subgraph (1986) (5)
- The mean order of sub‐k‐trees of k‐trees (2018) (5)
- A characterization of 3-Steiner distance hereditary graphs (1997) (5)
- Greatest common subgraphs with specified properties (1989) (5)
- On the roots of Wiener polynomials of graphs (2018) (5)
- Graphs with a Minimal Number of Convex Sets (2014) (5)
- An Algorithm to Find Two Distance Domination Parameters in a Graph (1996) (4)
- Comparing the metric and strong dimensions of graphs (2017) (4)
- Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs (2018) (4)
- On Domination and Digital Convexity Parameters (2013) (3)
- The threshold strong dimension of a graph (2020) (3)
- SOME GENERAL ASPECTS OF THE FRAMING NUMBER OF A GRAPH (1993) (3)
- Helly theorems for 3-Steiner and 3-monophonic convexity in graphs (2011) (3)
- A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance Hereditary (1995) (3)
- On the spectrum and number of convex sets in graphs (2015) (3)
- Degree Sequences of Optimally Edge-Connected Multigraphs (2005) (3)
- A characterization of 3‐Steiner distance hereditary graphs (1997) (2)
- Bipartite regulation numbers (1986) (2)
- The connected cutset connectivity of a graph (1988) (2)
- On the regulation number of a multigraph (1985) (2)
- Separation properties of 3-Steiner and 3-monophonic convexity in graphs (2012) (2)
- Degree Uniform Graphs a (1989) (2)
- The Threshold Dimension and Irreducible Graphs (2020) (2)
- On maximum matchings in cubic graphs with a bounded number of bridge-covering paths (1987) (2)
- Generating and Enumerating Digitally Convex Sets of Trees (2016) (2)
- Variations on a theorem of Petersen (1988) (2)
- Randomlyn-cyclic digraphs (1985) (2)
- Global cycle properties in graphs with large minimum clustering coefficient (2015) (2)
- Randomly $H$ graphs (1986) (2)
- Bounds on the size of graphs of given order and up/down-connectivity (1999) (1)
- A new algorithm for finding an upper bound of the genus of a graph (1991) (1)
- Hamiltonicity of k-Traceable Graphs (2011) (1)
- On Saito’s Conjecture and the Oberly–Sumner Conjectures (2017) (1)
- On the l-connectivity of a diagraph (1994) (1)
- On the Average (Edge-)Connectivity of Minimally k-(Edge-)Connected Graphs (2021) (1)
- m 3 -Convex Geometries are A-free. (2011) (1)
- Global properties of graphs with local degree conditions (2015) (1)
- Major n-connected graphs (1989) (1)
- Convexity Notions in Graphs (2006) (1)
- On the Steiner Periphery and Steiner Eccentricity of a Graph (1990) (1)
- On Saito’s Conjecture and the Oberly–Sumner Conjectures (2017) (0)
- Generating and Enumerating Digitally Convex Sets of Trees (2015) (0)
- Enumerating the Digitally Convex Sets of Powers of Cycles and Cartesian Products of Paths and Complete Graphs (2020) (0)
- The maximum average connectivity among all orientations of a graph (2019) (0)
- Graphs with a Minimal Number of Convex Sets (2013) (0)
- On the Strong Path Partition Conjecture (2022) (0)
- Some of My Favourite Conjectures: Local Conditions Implying Global Cycle Properties (2018) (0)
- The Threshold Dimension and Threshold Strong Dimension of a Graph: A Survey (2021) (0)
- Augmenting trees so that every three vertices lie on a cycle (2002) (0)
- The IrregularityCost of a Graph (1997) (0)
- A Matter of Degree (1989) (0)
- CPC volume 22 issue 1 Cover and Back matter (2012) (0)
- CPC volume 22 issue 3 Cover and Back matter (2013) (0)
- Reconstructing trees from digitally convex sets (2017) (0)
- Report on the BIRS Focused Research Workshop 15 frg 184 1 Local properties in graphs that imply global cycle properties Participants : (2015) (0)
- The Path Partition Conjecture for Oriented Graphs (2006) (0)
- Degree Sequen es of Optimally Edge-Conne ted Multigraphs (2014) (0)
- A note on a definite integral of combinatorial interest (2022) (0)

This paper list is powered by the following services:

Ortrud Oellermann is affiliated with the following schools:

This website uses cookies to enhance the user experience. Read the Privacy Policy for more.