Ortrud R. Oellermann

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 21

Top Topics

Top Venues

Discret. Appl. Math.

Discuss. Math. Graph Theory

Publications

Johan P. de Wet, Jean E. Dunbar, Marietjie Frick, Ortrud R. Oellermann
On the Strong Path Partition Conjecture. Discuss. Math. Graph Theory 44 (2) (2024)
Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann
The threshold dimension and irreducible graphs. Discuss. Math. Graph Theory 43 (1) (2023)
MacKenzie Carr, Christina M. Mynhardt, Ortrud R. Oellermann
Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs. Discuss. Math. Graph Theory 43 (3) (2023)
Lucas Mol, Ortrud R. Oellermann, Vibhav Oswal
On the average (edge-)connectivity of minimally k-(edge-)connected graphs. Bull. ICA 94 (2022)
Nadia Benakli, Novi H. Bong, Shonda Dueck, Linda Eroh, Beth Novick, Ortrud R. Oellermann
The threshold strong dimension of a graph. Discret. Math. 344 (7) (2021)
Rocío M. Casablanca, Lucas Mol, Ortrud R. Oellermann
Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs. Discret. Appl. Math. 289 (2021)
Lucas Mol, Ortrud R. Oellermann, Vibhav Oswal
On the Average (Edge-)Connectivity of Minimally k-(Edge-)Connected Graphs. CoRR (2021)
Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann
The threshold dimension of a graph. Discret. Appl. Math. 287 (2020)
Kristaps J. Balodis, Lucas Mol, Ortrud R. Oellermann, Matthew E. Kroeker
On the mean order of connected induced subgraphs of block graphs. Australas. J Comb. 76 (2020)
Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann
The Threshold Dimension and Irreducible Graphs. CoRR (2020)
Lucas Mol, Ortrud R. Oellermann
Maximizing the mean subtree order. J. Graph Theory 91 (4) (2019)
Matthew E. Kroeker, Lucas Mol, Ortrud R. Oellermann
On the mean connected induced subgraph order of cographs. Australas. J Comb. 71 (2018)
Alexander M. Stephens, Ortrud R. Oellermann
The mean order of sub-k-trees of k-trees. J. Graph Theory 88 (1) (2018)
Jason I. Brown, Lucas Mol, Ortrud R. Oellermann
On the roots of Wiener polynomials of graphs. Discret. Math. 341 (9) (2018)
Susan A. van Aardt, Jean E. Dunbar, Marietjie Frick, Ortrud R. Oellermann, Johan P. de Wet
On Saito's Conjecture and the Oberly-Sumner Conjectures. Graphs Comb. 33 (4) (2017)
Philip Lafrance, Ortrud R. Oellermann, Timothy Pressey
Reconstructing trees from digitally convex sets. Discret. Appl. Math. 216 (2017)
Gaia Moravcik, Ortrud R. Oellermann, Samuel Yusim
Comparing the metric and strong dimensions of graphs. Discret. Appl. Math. 220 (2017)
Yunior Ramírez-Cruz, Ortrud R. Oellermann, Juan A. Rodríguez-Velázquez
The simultaneous metric dimension of graph families. Discret. Appl. Math. 198 (2016)
Philip Lafrance, Ortrud R. Oellermann, Timothy Pressey
Generating and Enumerating Digitally Convex Sets of Trees. Graphs Comb. 32 (2) (2016)
Susan A. van Aardt, Marietjie Frick, Ortrud R. Oellermann, Johan P. de Wet
Global cycle properties in locally connected, locally traceable and locally hamiltonian graphs. Discret. Appl. Math. 205 (2016)
Adam Borchert, Skylar Nicol, Ortrud R. Oellermann
Global cycle properties of locally isometric graphs. Discret. Appl. Math. 205 (2016)
Jason I. Brown, Ortrud R. Oellermann
On the spectrum and number of convex sets in graphs. Discret. Math. 338 (7) (2015)
Jason I. Brown, Ortrud R. Oellermann
Graphs with a Minimal Number of Convex Sets. Graphs Comb. 30 (6) (2014)
Juan Alberto Rodríguez-Velázquez, Ismael González Yero, Dorota Kuziak, Ortrud R. Oellermann
On the strong metric dimension of Cartesian and direct products of graphs. Discret. Math. 335 (2014)
Yunior Ramírez-Cruz, Ortrud R. Oellermann, Juan Alberto Rodríguez-Velázquez
Simultaneous Resolvability in Graph Families. Electron. Notes Discret. Math. 46 (2014)
Morten Hegner Nielsen, Ortrud R. Oellermann
Separation properties of 3-Steiner and 3-monophonic convexity in graphs. Discret. Math. 312 (22) (2012)
José Cáceres, Ortrud R. Oellermann, María Luz Puertas
Minimal trees and monophonic convexity. Discuss. Math. Graph Theory 32 (4) (2012)
Frank Bullock, Peter Dankelmann, Marietjie Frick, Michael A. Henning, Ortrud R. Oellermann, Susan A. van Aardt
-Traceable Graphs. Electron. J. Comb. 18 (1) (2011)
Morten Hegner Nielsen, Ortrud R. Oellermann
Helly theorems for 3-Steiner and 3-monophonic convexity in graphs. Discret. Math. 311 (10-11) (2011)
Susan A. van Aardt, Jean E. Dunbar, Marietjie Frick, Peter Katrenic, Morten Hegner Nielsen, Ortrud R. Oellermann
Traceability of k-traceable oriented graphs. Discret. Math. 310 (8) (2010)
José Cáceres, Ortrud R. Oellermann
On 3-Steiner simplicial orderings. Discret. Math. 309 (19) (2009)
Morten Hegner Nielsen, Ortrud R. Oellermann
Steiner Trees and Convex Geometries. SIAM J. Discret. Math. 23 (2) (2009)
Michael A. Henning, Morten Hegner Nielsen, Ortrud R. Oellermann
Local Steiner convexity. Eur. J. Comb. 30 (5) (2009)
Marietjie Frick, Susan A. van Aardt, Jean E. Dunbar, Morten Hegner Nielsen, Ortrud R. Oellermann
A Traceability Conjecture for Oriented Graphs. Electron. J. Comb. 15 (1) (2008)
Linda Eroh, Ortrud R. Oellermann
Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs. Discret. Math. 308 (18) (2008)
Ortrud R. Oellermann, Joel Peters-Fransen
The strong metric dimension of graphs and digraphs. Discret. Appl. Math. 155 (3) (2007)
Ortrud R. Oellermann, María Luz Puertas
Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs. Discret. Math. 307 (1) (2007)
Ortrud R. Oellermann, Charlene D. Pawluck, Anna Stokke
The Metric Dimension of Cayley Digraphs of Abelian Groups. Ars Comb. 81 (2006)
Melodie Fehr, Shonda Gosselin, Ortrud R. Oellermann
The metric dimension of Cayley digraphs. Discret. Math. 306 (1) (2006)
Peter Dankelmann, Ortrud R. Oellermann
Degree Sequences of Optimally Edge-Connected Multigraphs. Ars Comb. 77 (2005)
Marietjie Frick, Susan A. van Aardt, Gcina Dlamini, Jean E. Dunbar, Ortrud R. Oellermann
The directed path partition conjecture. Discuss. Math. Graph Theory 25 (3) (2005)
José Cáceres, Alberto Márquez, Ortrud R. Oellermann, María Luz Puertas
Rebuilding convex sets in graphs. Discret. Math. 297 (1-3) (2005)
Michael A. Henning, Ortrud R. Oellermann
The average connectivity of regular multipartite tournaments. Australas. J Comb. 23 (2001)
Wayne Goddard, Michael A. Henning, Ortrud R. Oellermann
Bipartite Ramsey numbers and Zarankiewicz numbers. Discret. Math. 219 (1-3) (2000)
David P. Day, Ortrud R. Oellermann, Henda C. Swart
Bounds on the size of graphs of given order and up/down-connectivity. Discret. Math. (1999)
Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart
The diversity of domination. Discret. Math. 161 (1-3) (1996)
Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart
Local edge domination critical graphs. Discret. Math. 161 (1-3) (1996)
Peter Dankelmann, Ortrud R. Oellermann, Henda C. Swart
The average Steiner distance of a graph. J. Graph Theory 22 (1) (1996)
Ortrud R. Oellermann
From steiner centers to steiner medians. J. Graph Theory 20 (2) (1995)
Wayne Goddard, Ortrud R. Oellermann, Henda C. Swart
Steiner distance stable graphs. Discret. Math. 132 (1-3) (1994)
David P. Day, Ortrud R. Oellermann, Henda C. Swart
On the l-connectivity of a diagraph. Discret. Math. 127 (1-3) (1994)
Ortrud R. Oellermann
Conditional graph connectivity relative to hereditary properties. Networks 21 (2) (1991)
Wayne Goddard, Grzegorz Kubicki, Ortrud R. Oellermann, Songlin Tian
On multipartite tournaments. J. Comb. Theory, Ser. B 52 (2) (1991)
Ortrud R. Oellermann, Songlin Tian
Steiner centers in graphs. J. Graph Theory 14 (5) (1990)
Gary Chartrand, Ortrud R. Oellermann, Farrokh Saba, Hung Bin Zou
Greatest common subgraphs with specified properties. Graphs Comb. 5 (1) (1989)
Ortrud R. Oellermann
The connected cutset connectivity of a graph. Discret. Math. 69 (3) (1988)
Ortrud R. Oellermann
-connectivity of a graph. Graphs Comb. 3 (1) (1987)
Yousef Alavi, Gary Chartrand, Fan R. K. Chung, Paul Erdös, Ronald L. Graham, Ortrud R. Oellermann
Highly irregular graphs. J. Graph Theory 11 (2) (1987)
Linda M. Lesniak, Ortrud R. Oellermann
An Eulerian exposition. J. Graph Theory 10 (3) (1986)
Yousef Alavi, Gary Chartrand, Ortrud R. Oellermann, Linda M. Lesniak
Bipartite regulation numbers. Discret. Math. 62 (2) (1986)
Gary Chartrand, Frank Harary, Ortrud R. Oellermann
On the regulation number of a multigraph. Graphs Comb. 1 (1) (1985)
Gary Chartrand, Ortrud R. Oellermann, Sergio Ruiz
-cyclic digraphs. Graphs Comb. 1 (1) (1985)