Ortrud Oellermann

Publication Activity (10 Years)

Years Active: 1989-2022
Publications (10 Years): 1

Top Topics

Strongly Connected

Graph Connectivity

Topological Information

Minimum Spanning Tree

Top Venues

J. Comb. Optim.

Publications

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