Ortrud R. Oellermann

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
On the roots of Wiener polynomials of graphs.
Discrete Mathematics, 2018

On the mean connected induced subgraph order of cographs.
Australasian J. Combinatorics, 2018

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

Comparing the metric and strong dimensions of graphs.
Discrete Applied Mathematics, 2017

Reconstructing trees from digitally convex sets.
Discrete Applied Mathematics, 2017

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

The simultaneous metric dimension of graph families.
Discrete Applied Mathematics, 2016

Global cycle properties of locally isometric graphs.
Discrete Applied Mathematics, 2016

Global cycle properties in locally connected, locally traceable and locally hamiltonian graphs.
Discrete Applied Mathematics, 2016

2015
On the spectrum and number of convex sets in graphs.
Discrete Mathematics, 2015

2014
Graphs with a Minimal Number of Convex Sets.
Graphs and Combinatorics, 2014

Simultaneous Resolvability in Graph Families.
Electronic Notes in Discrete Mathematics, 2014

On the strong metric dimension of Cartesian and direct products of graphs.
Discrete Mathematics, 2014

2012
Minimal trees and monophonic convexity.
Discussiones Mathematicae Graph Theory, 2012

Separation properties of 3-Steiner and 3-monophonic convexity in graphs.
Discrete Mathematics, 2012

2011
Helly theorems for 3-Steiner and 3-monophonic convexity in graphs.
Discrete Mathematics, 2011

Hamiltonicity of k-Traceable Graphs.
Electr. J. Comb., 2011

2010
Traceability of k-traceable oriented graphs.
Discrete Mathematics, 2010

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

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

On 3-Steiner simplicial orderings.
Discrete Mathematics, 2009

2008
Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs.
Discrete Mathematics, 2008

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

2007
Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs.
Discrete Mathematics, 2007

The strong metric dimension of graphs and digraphs.
Discrete Applied Mathematics, 2007

2006
The metric dimension of Cayley digraphs.
Discrete Mathematics, 2006

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

2005
The directed path partition conjecture.
Discussiones Mathematicae Graph Theory, 2005

Rebuilding convex sets in graphs.
Discrete Mathematics, 2005

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

2004
On upper domination Ramsey numbers for graphs.
Discrete Mathematics, 2004

Bipartite rainbow Ramsey numbers.
Discrete Mathematics, 2004

The average connectivity of a digraph.
Discrete Applied Mathematics, 2004

Minimum average distance of strong orientations of graphs.
Discrete Applied Mathematics, 2004

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

2003
Bounds on the average connectivity of a graph.
Discrete Applied Mathematics, 2003

2002
The upper domination Ramsey number u(3, 3, 3).
Discrete Mathematics, 2002

The average connectivity of a graph.
Discrete Mathematics, 2002

Augmenting trees so that every three vertices lie on a cycle.
Discrete Applied Mathematics, 2002

2001
The average connectivity of regular multipartite tournaments.
Australasian J. Combinatorics, 2001

2000
Bipartite Ramsey numbers and Zarankiewicz numbers.
Discrete Mathematics, 2000

Resolvability in graphs and the metric dimension of a graph.
Discrete Applied Mathematics, 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.
Discrete Mathematics, 1999

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

1998
Steiner Intervals in Graphs.
Discrete Applied Mathematics, 1998

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

On the Average Steiner Distance of Graphs with Prescribed Properties.
Discrete Applied Mathematics, 1997

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

Local edge domination critical graphs.
Discrete Mathematics, 1996

The diversity of domination.
Discrete Mathematics, 1996

An Algorithm to Find Two Distance Domination Parameters in a Graph.
Discrete Applied Mathematics, 1996

on the Steiner Median of a Tree.
Discrete Applied Mathematics, 1996

1995
From steiner centers to steiner medians.
Journal of 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. Discrete Math., 1994

Steiner distance stable graphs.
Discrete Mathematics, 1994

On the l-connectivity of a diagraph.
Discrete Mathematics, 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.
Journal of Graph Theory, 1990

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

Greatest common subgraphs with specified properties.
Graphs and Combinatorics, 1989

1988
The connected cutset connectivity of a graph.
Discrete Mathematics, 1988

1987
Highly irregular graphs.
Journal of Graph Theory, 1987

On thel-connectivity of a graph.
Graphs and Combinatorics, 1987

1986
An Eulerian exposition.
Journal of Graph Theory, 1986

Bipartite regulation numbers.
Discrete Mathematics, 1986

1985
Randomlyn-cyclic digraphs.
Graphs and Combinatorics, 1985

On the regulation number of a multigraph.
Graphs and Combinatorics, 1985


  Loading...