Ortrud R. Oellermann

According to our database1, Ortrud R. Oellermann authored at least 80 papers between 1985 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
The maximum average connectivity among all orientations of a graph.
J. Comb. Optim., 2022

2021
The threshold strong dimension of a graph.
Discret. Math., 2021

Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs.
Discret. Appl. Math., 2021

On the Average (Edge-)Connectivity of Minimally k-(Edge-)Connected Graphs.
CoRR, 2021

2020
The threshold dimension of a graph.
Discret. Appl. Math., 2020

The Threshold Dimension and Irreducible Graphs.
CoRR, 2020

On the mean order of connected induced subgraphs of block graphs.
Australas. J Comb., 2020

2019
Maximizing the mean subtree order.
J. Graph Theory, 2019

2018
The mean order of sub-k-trees of k-trees.
J. Graph Theory, 2018

On the roots of Wiener polynomials of graphs.
Discret. Math., 2018

On the mean connected induced subgraph order of cographs.
Australas. J Comb., 2018

2017
On Saito's Conjecture and the Oberly-Sumner Conjectures.
Graphs Comb., 2017

Comparing the metric and strong dimensions of graphs.
Discret. Appl. Math., 2017

Reconstructing trees from digitally convex sets.
Discret. Appl. Math., 2017

2016
Generating and Enumerating Digitally Convex Sets of Trees.
Graphs Comb., 2016

The simultaneous metric dimension of graph families.
Discret. Appl. Math., 2016

Global cycle properties of locally isometric graphs.
Discret. Appl. Math., 2016

Global cycle properties in locally connected, locally traceable and locally hamiltonian graphs.
Discret. Appl. Math., 2016

2015
On the spectrum and number of convex sets in graphs.
Discret. Math., 2015

2014
Graphs with a Minimal Number of Convex Sets.
Graphs Comb., 2014

Simultaneous Resolvability in Graph Families.
Electron. Notes Discret. Math., 2014

On the strong metric dimension of Cartesian and direct products of graphs.
Discret. Math., 2014

2012
Minimal trees and monophonic convexity.
Discuss. Math. Graph Theory, 2012

Separation properties of 3-Steiner and 3-monophonic convexity in graphs.
Discret. Math., 2012

2011
Helly theorems for 3-Steiner and 3-monophonic convexity in graphs.
Discret. Math., 2011

Hamiltonicity of <i>k</i>-Traceable Graphs.
Electron. J. Comb., 2011

Distance in Graphs.
Proceedings of the Structural Analysis of Complex Networks, 2011

2010
Traceability of k-traceable oriented graphs.
Discret. Math., 2010

2009
Steiner Trees and Convex Geometries.
SIAM J. Discret. Math., 2009

Local Steiner convexity.
Eur. J. Comb., 2009

On 3-Steiner simplicial orderings.
Discret. Math., 2009

2008
Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs.
Discret. Math., 2008

A Traceability Conjecture for Oriented Graphs.
Electron. J. Comb., 2008

2007
Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs.
Discret. Math., 2007

The strong metric dimension of graphs and digraphs.
Discret. Appl. Math., 2007

2006
The metric dimension of Cayley digraphs.
Discret. Math., 2006

The Metric Dimension of Cayley Digraphs of Abelian Groups.
Ars Comb., 2006

2005
The directed path partition conjecture.
Discuss. Math. Graph Theory, 2005

Rebuilding convex sets in graphs.
Discret. Math., 2005

Degree Sequences of Optimally Edge-Connected Multigraphs.
Ars Comb., 2005

2004
On upper domination Ramsey numbers for graphs.
Discret. Math., 2004

Bipartite rainbow Ramsey numbers.
Discret. Math., 2004

The average connectivity of a digraph.
Discret. Appl. Math., 2004

Minimum average distance of strong orientations of graphs.
Discret. Appl. Math., 2004

Metric-Locating-Dominating Sets in Graphs.
Ars Comb., 2004

2003
Bounds on the average connectivity of a graph.
Discret. Appl. Math., 2003

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

The average connectivity of a graph.
Discret. Math., 2002

Augmenting trees so that every three vertices lie on a cycle.
Discret. Appl. Math., 2002

2001
The average connectivity of regular multipartite tournaments.
Australas. J Comb., 2001

2000
Bipartite Ramsey numbers and Zarankiewicz numbers.
Discret. Math., 2000

Resolvability in graphs and the metric dimension of a graph.
Discret. Appl. Math., 2000

1999
On Steiner centers and Steiner medians of graphs.
Networks, 1999

Bounds on the size of graphs of given order and up/down-connectivity.
Discret. Math., 1999

Bounds on the Total Redundance and Efficiency of a Graph.
Ars Comb., 1999

1998
Steiner Intervals in Graphs.
Discret. Appl. Math., 1998

1997
A characterization of 3-Steiner distance hereditary graphs.
Networks, 1997

On the Average Steiner Distance of Graphs with Prescribed Properties.
Discret. Appl. Math., 1997

1996
The average Steiner distance of a graph.
J. Graph Theory, 1996

Local edge domination critical graphs.
Discret. Math., 1996

The diversity of domination.
Discret. Math., 1996

An Algorithm to Find Two Distance Domination Parameters in a Graph.
Discret. Appl. Math., 1996

on the Steiner Median of a Tree.
Discret. Appl. Math., 1996

1995
From steiner centers to steiner medians.
J. Graph Theory, 1995

A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance Hereditary.
Inf. Process. Lett., 1995

1994
Steiner Distance-Hereditary Graphs.
SIAM J. Discret. Math., 1994

Steiner distance stable graphs.
Discret. Math., 1994

On the l-connectivity of a diagraph.
Discret. Math., 1994

1991
Conditional graph connectivity relative to hereditary properties.
Networks, 1991

On multipartite tournaments.
J. Comb. Theory, Ser. B, 1991

1990
Steiner centers in graphs.
J. Graph Theory, 1990

1989
A Matter of Degree.
SIAM J. Discret. Math., 1989

Greatest common subgraphs with specified properties.
Graphs Comb., 1989

1988
The connected cutset connectivity of a graph.
Discret. Math., 1988

1987
Highly irregular graphs.
J. Graph Theory, 1987

On the<i>l</i>-connectivity of a graph.
Graphs Comb., 1987

1986
An Eulerian exposition.
J. Graph Theory, 1986

Bipartite regulation numbers.
Discret. Math., 1986

1985
Randomly<i>n</i>-cyclic digraphs.
Graphs Comb., 1985

On the regulation number of a multigraph.
Graphs Comb., 1985


  Loading...