Ortrud R. Oellermann

According to our database, Ortrud R. Oellermann authored at least 81 papers between 1985 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of one.

2023

The threshold dimension and irreducible graphs.

Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann

Discuss. Math. Graph Theory, 2023

Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs.

MacKenzie Carr, Christina M. Mynhardt, Ortrud R. Oellermann

Discuss. Math. Graph Theory, 2023

2022

The maximum average connectivity among all orientations of a graph.

Rocío M. Casablanca, Peter Dankelmann, Wayne Goddard, Lucas Mol, Ortrud Oellermann

J. Comb. Optim., 2022

On the average (edge-)connectivity of minimally k-(edge-)connected graphs.

Lucas Mol, Ortrud R. Oellermann, Vibhav Oswal

Bull. ICA, 2022

2021

The threshold strong dimension of a graph.

Nadia Benakli, Novi H. Bong, Shonda Dueck, Linda Eroh, Beth Novick, Ortrud R. Oellermann

Discret. Math., 2021

Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs.

Rocío M. Casablanca, Lucas Mol, Ortrud R. Oellermann

Discret. Appl. Math., 2021

2020

The threshold dimension of a graph.

Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann

Discret. Appl. Math., 2020

On the mean order of connected induced subgraphs of block graphs.

Kristaps J. Balodis, Lucas Mol, Ortrud R. Oellermann, Matthew E. Kroeker

Australas. J Comb., 2020

2019

Maximizing the mean subtree order.

Lucas Mol, Ortrud R. Oellermann

J. Graph Theory, 2019

2018

The mean order of sub-k-trees of k-trees.

Alexander M. Stephens, Ortrud R. Oellermann

J. Graph Theory, 2018

On the roots of Wiener polynomials of graphs.

Jason I. Brown, Lucas Mol, Ortrud R. Oellermann

Discret. Math., 2018

On the mean connected induced subgraph order of cographs.

Matthew E. Kroeker, Lucas Mol, Ortrud R. Oellermann

Australas. J Comb., 2018

2017

On Saito's Conjecture and the Oberly-Sumner Conjectures.

Susan A. van Aardt, Jean E. Dunbar, Marietjie Frick, Ortrud R. Oellermann, Johan P. de Wet

Graphs Comb., 2017

Comparing the metric and strong dimensions of graphs.

Gaia Moravcik, Ortrud R. Oellermann, Samuel Yusim

Discret. Appl. Math., 2017

Reconstructing trees from digitally convex sets.

Philip Lafrance, Ortrud R. Oellermann, Timothy Pressey

Discret. Appl. Math., 2017

2016

Generating and Enumerating Digitally Convex Sets of Trees.

Philip Lafrance, Ortrud R. Oellermann, Timothy Pressey

Graphs Comb., 2016

The simultaneous metric dimension of graph families.

Yunior Ramírez-Cruz, Ortrud R. Oellermann, Juan A. Rodríguez-Velázquez

Discret. Appl. Math., 2016

Global cycle properties of locally isometric graphs.

Adam Borchert, Skylar Nicol, Ortrud R. Oellermann

Discret. Appl. Math., 2016

Global cycle properties in locally connected, locally traceable and locally hamiltonian graphs.

Susan A. van Aardt, Marietjie Frick, Ortrud R. Oellermann, Johan P. de Wet

Discret. Appl. Math., 2016

2015

On the spectrum and number of convex sets in graphs.

Jason I. Brown, Ortrud R. Oellermann

Discret. Math., 2015

2014

Graphs with a Minimal Number of Convex Sets.

Jason I. Brown, Ortrud R. Oellermann

Graphs Comb., 2014

Simultaneous Resolvability in Graph Families.

Yunior Ramírez-Cruz, Ortrud R. Oellermann, Juan Alberto Rodríguez-Velázquez

Electron. Notes Discret. Math., 2014

On the strong metric dimension of Cartesian and direct products of graphs.

Juan Alberto Rodríguez-Velázquez, Ismael González Yero, Dorota Kuziak, Ortrud R. Oellermann

Discret. Math., 2014

2012

Minimal trees and monophonic convexity.

José Cáceres, Ortrud R. Oellermann, María Luz Puertas

Discuss. Math. Graph Theory, 2012

Separation properties of 3-Steiner and 3-monophonic convexity in graphs.

Morten Hegner Nielsen, Ortrud R. Oellermann

Discret. Math., 2012

2011

Helly theorems for 3-Steiner and 3-monophonic convexity in graphs.

Morten Hegner Nielsen, Ortrud R. Oellermann

Discret. Math., 2011

Hamiltonicity of <i>k</i>-Traceable Graphs.

Frank Bullock, Peter Dankelmann, Marietjie Frick, Michael A. Henning, Ortrud R. Oellermann, Susan A. van Aardt

Electron. J. Comb., 2011

Distance in Graphs.

Wayne Goddard, Ortrud R. Oellermann

Proceedings of the Structural Analysis of Complex Networks, 2011

2010

Traceability of k-traceable oriented graphs.

Susan A. van Aardt, Jean E. Dunbar, Marietjie Frick, Peter Katrenic, Morten Hegner Nielsen, Ortrud R. Oellermann

Discret. Math., 2010

2009

Steiner Trees and Convex Geometries.

Morten Hegner Nielsen, Ortrud R. Oellermann

SIAM J. Discret. Math., 2009

Local Steiner convexity.

Michael A. Henning, Morten Hegner Nielsen, Ortrud R. Oellermann

Eur. J. Comb., 2009

On 3-Steiner simplicial orderings.

José Cáceres, Ortrud R. Oellermann

Discret. Math., 2009

2008

Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs.

Linda Eroh, Ortrud R. Oellermann

Discret. Math., 2008

A Traceability Conjecture for Oriented Graphs.

Marietjie Frick, Susan A. van Aardt, Jean E. Dunbar, Morten Hegner Nielsen, Ortrud R. Oellermann

Electron. J. Comb., 2008

2007

Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs.

Ortrud R. Oellermann, María Luz Puertas

Discret. Math., 2007

The strong metric dimension of graphs and digraphs.

Ortrud R. Oellermann, Joel Peters-Fransen

Discret. Appl. Math., 2007

2006

The metric dimension of Cayley digraphs.

Melodie Fehr, Shonda Gosselin, Ortrud R. Oellermann

Discret. Math., 2006

The Metric Dimension of Cayley Digraphs of Abelian Groups.

Ortrud R. Oellermann, Charlene D. Pawluck, Anna Stokke

Ars Comb., 2006

2005

The directed path partition conjecture.

Marietjie Frick, Susan A. van Aardt, Gcina Dlamini, Jean E. Dunbar, Ortrud R. Oellermann

Discuss. Math. Graph Theory, 2005

Rebuilding convex sets in graphs.

José Cáceres, Alberto Márquez, Ortrud R. Oellermann, María Luz Puertas

Discret. Math., 2005

Degree Sequences of Optimally Edge-Connected Multigraphs.

Peter Dankelmann, Ortrud R. Oellermann

Ars Comb., 2005

2004

On upper domination Ramsey numbers for graphs.

Michael A. Henning, Ortrud Oellermann

Discret. Math., 2004

Bipartite rainbow Ramsey numbers.

Linda Eroh, Ortrud Oellermann

Discret. Math., 2004

The average connectivity of a digraph.

Michael A. Henning, Ortrud Oellermann

Discret. Appl. Math., 2004

Minimum average distance of strong orientations of graphs.

Peter Dankelmann, Ortrud Oellermann, Jian-Liang Wu

Discret. Appl. Math., 2004

Metric-Locating-Dominating Sets in Graphs.

Michael A. Henning, Ortrud Oellermann

Ars Comb., 2004

2003

Bounds on the average connectivity of a graph.

Peter Dankelmann, Ortrud Oellermann

Discret. Appl. Math., 2003

2002

The upper domination Ramsey number <i>u</i>(3, 3, 3).

Michael A. Henning, Ortrud Oellermann

Discret. Math., 2002

The average connectivity of a graph.

Lowell W. Beineke, Ortrud Oellermann, Raymond E. Pippert

Discret. Math., 2002

Augmenting trees so that every three vertices lie on a cycle.

Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart

Discret. Appl. Math., 2002

2001

The average connectivity of regular multipartite tournaments.

Michael A. Henning, Ortrud R. Oellermann

Australas. J Comb., 2001

2000

Bipartite Ramsey numbers and Zarankiewicz numbers.

Wayne Goddard, Michael A. Henning, Ortrud R. Oellermann

Discret. Math., 2000

Resolvability in graphs and the metric dimension of a graph.

Gary Chartrand, Linda Eroh, Mark A. Johnson, Ortrud Oellermann

Discret. Appl. Math., 2000

1999

On Steiner centers and Steiner medians of graphs.

Ortrud Oellermann

Networks, 1999

Bounds on the size of graphs of given order and up/down-connectivity.

David P. Day, Ortrud R. Oellermann, Henda C. Swart

Discret. Math., 1999

Bounds on the Total Redundance and Efficiency of a Graph.

Wayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart

Ars Comb., 1999

1998

Steiner Intervals in Graphs.

Ewa M. Kubicka, Grzegorz Kubicki, Ortrud Oellermann

Discret. Appl. Math., 1998

1997

A characterization of 3-Steiner distance hereditary graphs.

David P. Day, Ortrud Oellermann, Henda C. Swart

Networks, 1997

On the Average Steiner Distance of Graphs with Prescribed Properties.

Peter Dankelmann, Henda C. Swart, Ortrud Oellermann

Discret. Appl. Math., 1997

1996

The average Steiner distance of a graph.

Peter Dankelmann, Ortrud R. Oellermann, Henda C. Swart

J. Graph Theory, 1996

Local edge domination critical graphs.

Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart

Discret. Math., 1996

The diversity of domination.

Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart

Discret. Math., 1996

An Algorithm to Find Two Distance Domination Parameters in a Graph.

Gerd Fricke, Michael A. Henning, Ortrud Oellermann, Henda C. Swart

Discret. Appl. Math., 1996

on the Steiner Median of a Tree.

Lowell W. Beineke, Ortrud Oellermann, Raymond E. Pippert

Discret. Appl. Math., 1996

1995

From steiner centers to steiner medians.

Ortrud R. Oellermann

J. Graph Theory, 1995

A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance Hereditary.

Ortrud Oellermann, Jeremy P. Spinrad

Inf. Process. Lett., 1995

1994

Steiner Distance-Hereditary Graphs.

David P. Day, Ortrud Oellermann, Henda C. Swart

SIAM J. Discret. Math., 1994

Steiner distance stable graphs.

Wayne Goddard, Ortrud R. Oellermann, Henda C. Swart

Discret. Math., 1994

On the l-connectivity of a diagraph.

David P. Day, Ortrud R. Oellermann, Henda C. Swart

Discret. Math., 1994

1991

Conditional graph connectivity relative to hereditary properties.

Ortrud R. Oellermann

Networks, 1991

On multipartite tournaments.

Wayne Goddard, Grzegorz Kubicki, Ortrud R. Oellermann, Songlin Tian

J. Comb. Theory, Ser. B, 1991

1990

Steiner centers in graphs.

Ortrud R. Oellermann, Songlin Tian

J. Graph Theory, 1990

1989

A Matter of Degree.

Gary Chartrand, Héctor Hevia, Ortrud Oellermann, Farrokh Saba, Allen J. Schwenk

SIAM J. Discret. Math., 1989

Greatest common subgraphs with specified properties.

Gary Chartrand, Ortrud R. Oellermann, Farrokh Saba, Hung Bin Zou

Graphs Comb., 1989

1988

The connected cutset connectivity of a graph.

Ortrud R. Oellermann

Discret. Math., 1988

1987

Highly irregular graphs.

Yousef Alavi, Gary Chartrand, Fan R. K. Chung, Paul Erdös, Ronald L. Graham, Ortrud R. Oellermann

J. Graph Theory, 1987

On the<i>l</i>-connectivity of a graph.

Ortrud R. Oellermann

Graphs Comb., 1987

1986

An Eulerian exposition.

Linda M. Lesniak, Ortrud R. Oellermann

J. Graph Theory, 1986

Bipartite regulation numbers.

Yousef Alavi, Gary Chartrand, Ortrud R. Oellermann, Linda M. Lesniak

Discret. Math., 1986

1985

Randomly<i>n</i>-cyclic digraphs.

Gary Chartrand, Ortrud R. Oellermann, Sergio Ruiz

Graphs Comb., 1985

On the regulation number of a multigraph.

Gary Chartrand, Frank Harary, Ortrud R. Oellermann

Graphs Comb., 1985