Ortrud Oellermann - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 21 from 21

2022

The maximum average connectivity among all orientations of a graphRocío M. Casablanca, Peter Dankelmann, Wayne Goddard, Lucas Mol, Ortrud Oellermann. jco, 43(3):543-570, 2022. [doi]

2004

Minimum average distance of strong orientations of graphsPeter Dankelmann, Ortrud Oellermann, Jian-Liang Wu. DAM, 143(1-3):204-212, 2004. [doi]

Bipartite rainbow Ramsey numbersLinda Eroh, Ortrud Oellermann. DM, 277(1-3):57-72, 2004. [doi]

The average connectivity of a digraphMichael A. Henning, Ortrud Oellermann. DAM, 140(1-3):143-153, 2004. [doi]

Metric-Locating-Dominating Sets in GraphsMichael A. Henning, Ortrud Oellermann. arscom, 73, 2004.

On upper domination Ramsey numbers for graphsMichael A. Henning, Ortrud Oellermann. DM, 274(1-3):125-135, 2004. [doi]

2003

Bounds on the average connectivity of a graphPeter Dankelmann, Ortrud Oellermann. DAM, 129(2-3):305-318, 2003. [doi]

2002

The average connectivity of a graphLowell W. Beineke, Ortrud Oellermann, Raymond E. Pippert. DM, 252(1-3):31-45, 2002. [doi]

Augmenting trees so that every three vertices lie on a cyclePeter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart. DAM, 116(1-2):145-159, 2002.

The upper domination Ramsey number ::::u::::(3, 3, 3)Michael A. Henning, Ortrud Oellermann. DM, 242(1-3):103-113, 2002. [doi]

2000

Resolvability in graphs and the metric dimension of a graphGary Chartrand, Linda Eroh, Mark A. Johnson, Ortrud Oellermann. DAM, 105(1-3):99-113, 2000.

1999

Bounds on the Total Redundance and Efficiency of a GraphWayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart. arscom, 54, 1999.

On Steiner centers and Steiner medians of graphsOrtrud Oellermann. networks, 34(4):258-263, 1999. [doi]

1998

Steiner Intervals in GraphsEwa Kubicka, Grzegorz Kubicki, Ortrud Oellermann. DAM, 81(1-3):181-190, 1998. [doi]

1997

On the Average Steiner Distance of Graphs with Prescribed PropertiesPeter Dankelmann, Henda C. Swart, Ortrud Oellermann. DAM, 79(1-3):91-103, 1997. [doi]

A characterization of 3-Steiner distance hereditary graphsDavid P. Day, Ortrud Oellermann, Henda C. Swart. networks, 30(4):243-253, 1997. [doi]

1996

on the Steiner Median of a TreeLowell W. Beineke, Ortrud Oellermann, Raymond E. Pippert. DAM, 68(3):249-258, 1996. [doi]

An Algorithm to Find Two Distance Domination Parameters in a GraphGerd Fricke, Michael A. Henning, Ortrud Oellermann, Henda C. Swart. DAM, 68(1-2):85-91, 1996. [doi]

1995

A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance HereditaryOrtrud Oellermann, Jeremy Spinrad. ipl, 55(3):149-154, 1995. [doi]

1994

Steiner Distance-Hereditary GraphsDavid P. Day, Ortrud Oellermann, Henda C. Swart. siamdm, 7(3):437-442, 1994. [doi]

1989

A Matter of DegreeGary Chartrand, Héctor Hevia, Ortrud Oellermann, Farrokh Saba, A. Schwenk. siamdm, 2(4):456-466, 1989.

Sign in or sign up to see more results.

runs on WebDSL