Ortrud Oellermann

21 papers Journal 21
YearRankTypeTitle / Venue / Authors
2022 J jnl
The maximum average connectivity among all orientations of a graph.
J. Comb. Optim.
Rocío M. Casablanca, Peter Dankelmann, Wayne Goddard, Lucas Mol, Ortrud Oellermann
2004 J jnl
Bipartite rainbow Ramsey numbers.
Discret. Math.
Linda Eroh, Ortrud Oellermann
2004 J jnl
Metric-Locating-Dominating Sets in Graphs.
Ars Comb.
Michael A. Henning, Ortrud Oellermann
2004 J jnl
Minimum average distance of strong orientations of graphs.
Discret. Appl. Math.
Peter Dankelmann, Ortrud Oellermann, Jian-Liang Wu
2004 J jnl
On upper domination Ramsey numbers for graphs.
Discret. Math.
Michael A. Henning, Ortrud Oellermann
2004 J jnl
The average connectivity of a digraph.
Discret. Appl. Math.
Michael A. Henning, Ortrud Oellermann
2003 J jnl
Bounds on the average connectivity of a graph.
Discret. Appl. Math.
Peter Dankelmann, Ortrud Oellermann
2002 J jnl
Augmenting trees so that every three vertices lie on a cycle.
Discret. Appl. Math.
Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart
2002 J jnl
The average connectivity of a graph.
Discret. Math.
Lowell W. Beineke, Ortrud Oellermann, Raymond E. Pippert
2002 J jnl
The upper domination Ramsey number
Discret. Math.
Michael A. Henning, Ortrud Oellermann
2000 J jnl
Resolvability in graphs and the metric dimension of a graph.
Discret. Appl. Math.
Gary Chartrand, Linda Eroh, Mark A. Johnson, Ortrud Oellermann
1999 J jnl
Bounds on the Total Redundance and Efficiency of a Graph.
Ars Comb.
Wayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart
1999 J jnl
On Steiner centers and Steiner medians of graphs.
Networks
Ortrud Oellermann
1998 J jnl
Steiner Intervals in Graphs.
Discret. Appl. Math.
Ewa M. Kubicka, Grzegorz Kubicki, Ortrud Oellermann
1997 J jnl
A characterization of 3-Steiner distance hereditary graphs.
Networks
David P. Day, Ortrud Oellermann, Henda C. Swart
1997 J jnl
On the Average Steiner Distance of Graphs with Prescribed Properties.
Discret. Appl. Math.
Peter Dankelmann, Henda C. Swart, Ortrud Oellermann
1996 J jnl
An Algorithm to Find Two Distance Domination Parameters in a Graph.
Discret. Appl. Math.
Gerd Fricke, Michael A. Henning, Ortrud Oellermann, Henda C. Swart
1996 J jnl
on the Steiner Median of a Tree.
Discret. Appl. Math.
Lowell W. Beineke, Ortrud Oellermann, Raymond E. Pippert
1995 J jnl
A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance Hereditary.
Inf. Process. Lett.
Ortrud Oellermann, Jeremy P. Spinrad
1994 J jnl
Steiner Distance-Hereditary Graphs.
SIAM J. Discret. Math.
David P. Day, Ortrud Oellermann, Henda C. Swart
1989 J jnl
A Matter of Degree.
SIAM J. Discret. Math.
Gary Chartrand, Héctor Hevia, Ortrud Oellermann, Farrokh Saba, Allen J. Schwenk