Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphsEROH, Linda; OELLERMANN, Ortrud R.Discrete mathematics. 2008, Vol 308, Num 18, pp 4212-4220, issn 0012-365X, 9 p.Article

Bipartite rainbow Ramsey numbersEROH, Linda; OELLERMANN, Ortrud R.Discrete mathematics. 2004, Vol 277, Num 1-3, pp 57-72, issn 0012-365X, 16 p.Article

Bounds on the average connectivity of a graphDANKELMANN, Peter; OELLERMANN, Ortrud R.Discrete applied mathematics. 2003, Vol 129, Num 2-3, pp 305-318, issn 0166-218X, 14 p.Article

The strong metric dimension of graphs and digraphsOELLERMANN, Ortrud R; PETERS-FRANSEN, Joel.Discrete applied mathematics. 2007, Vol 155, Num 3, pp 356-364, issn 0166-218X, 9 p.Article

Minimum average distance of strong orientations of graphsDANKELMANN, Peter; OELLERMANN, Ortrud R; WU, Jian-Liang et al.Discrete applied mathematics. 2004, Vol 143, Num 1-3, pp 204-212, issn 0166-218X, 9 p.Article

The upper domination Ramsey number u(3,3,3)HENNING, Michael A; OELLERMANN, Ortrud R.Discrete mathematics. 2002, Vol 242, Num 1-3, pp 103-113, issn 0012-365XArticle

On upper domination Ramsey numbers for graphsHENNING, Michael A; OELLERMANN, Ortrud R.Discrete mathematics. 2004, Vol 274, Num 1-3, pp 125-135, issn 0012-365X, 11 p.Article

The average connectivity of a graphBEINEKE, Lowell W; OELLERMANN, Ortrud R; PIPPERT, Raymond E et al.Discrete mathematics. 2002, Vol 252, Num 1-3, pp 31-45, issn 0012-365XArticle

Augmenting trees so that every three vertices lie on a cycleDANKELMANN, Peter; GODDARD, Wayne; OELLERMANN, Ortrud R et al.Discrete applied mathematics. 2002, Vol 116, Num 1-2, pp 145-159, issn 0166-218XArticle

Resolvability in graphs and the metric dimension of a graphCHARTRAND, Gary; EROH, Linda; JOHNSON, Mark A et al.Discrete applied mathematics. 2000, Vol 105, Num 1-3, pp 99-113, issn 0166-218XArticle