|Awards||Silver British Association Medal |
Meiring Naude Medal,
|Alma mater||University of Natal, |
Western Michigan University
|Thesis||Generalized Connectivity in Graphs|
|Doctoral advisor||Gary Chartrand|
|Institutions||University of Durban-Westville,|
Western Michigan University,
University of Natal,
University of Winnipeg
|Notable works||Applied and Algorithmic Graph Theory|
Education and career
Oellermann was born in Vryheid. She earned a bachelor's degree, cum laude honours, and a master's degree at the University of Natal in 1981, 1982, and 1983 respectively, as a student of Henda Swart. She completed her Ph.D. in 1986 at Western Michigan University. Her dissertation was Generalized Connectivity in Graphs and was supervised by Gary Chartrand.
Oellermann taught at the University of Durban-Westville, Western Michigan University, University of Natal, and Brandon University, before moving to Winnipeg in 1996. At Winnipeg, she was co-chair of mathematics and statistics for 2011–2013.
With Gary Chartrand, Oellermann is the author of the book Applied and Algorithmic Graph Theory (McGraw Hill, 1993).[AA]
She is also the author of well-cited research publications on metric dimension of graphs[MD], on distance-based notions of convex hulls in graphs,[CS] and on highly irregular graphs in which every vertex has a neighborhood in which all degrees are distinct.[IG] The phrase "highly irregular" was a catchphrase of her co-author Yousef Alavi; because of this, Ronald Graham suggested that there should be a concept of highly irregular graphs, by analogy to the regular graphs, and Oellermann came up with the definition of these graphs.
In 1991, Oellermann was the winner of the annual Silver British Association Medal of the Southern Africa Association for the Advancement of Science. She won the Meiring Naude Medal of the Royal Society of South Africa in 1994. She was also one of three winners of the Hall Medal of the Institute of Combinatorics and its Applications in 1994, the first year the medal was awarded.
|AA.||Chartrand, Gary; Oellermann, Ortrud R. (1993), Applied and Algorithmic Graph Theory, International Series in Pure and Applied Mathematics, New York: McGraw-Hill, Inc., ISBN 0-07-557101-3, MR 1211413|
|IG.||Alavi, Yousef; Chartrand, Gary; Chung, F. R. K.; Erdős, Paul; Graham, R. L.; Oellermann, Ortrud R. (1987), "Highly irregular graphs", Journal of Graph Theory, 11 (2): 235–249, doi:10.1002/jgt.3190110214, MR 0889356|
|MD.||Chartrand, Gary; Eroh, Linda; Johnson, Mark A.; Oellermann, Ortrud R. (2000), "Resolvability in graphs and the metric dimension of a graph", Discrete Applied Mathematics, 105 (1–3): 99–113, doi:10.1016/S0166-218X(00)00198-0, MR 1780464|
|CS.||Cáceres, José; Márquez, Alberto; Oellermann, Ortrud R.; Luz Puertas, María (2005), "Rebuilding convex sets in graphs", Discrete Mathematics, 297 (1–3): 26–37, doi:10.1016/j.disc.2005.03.020, MR 2159429|
- Author biography from Chartrand, Gary; Erdős, Paul; Oellermann, Ortrud R. (1988), "How to define an irregular graph", The College Mathematics Journal, 19 (1): 36–42, doi:10.2307/2686701, MR 0931654
- Education, Professional Service, and Administration (PDF), retrieved 2018-02-11
- Group Democracy and Governance, Human Sciences Research Council, Department of Arts, Culture, Science, and Technology, South Africa (2000), Women Marching Into the 21st Century: Wathint' Abafazi, Wathint' Imbokodo, Sherano Printers, p. 192, ISBN 9780796919663
- Ortrud Oellermann at the Mathematics Genealogy Project
- Chartrand, Gary (2016), "Highly irregular", in Gera, Ralucca; Hedetniemi, Stephen; Larson, Craig, Graph Theory: Favorite Conjectures and Open Problems – 1, Problem Books in Mathematics, Cham: Springer, pp. 1–16, MR 3617180. See in particular p. 9.
- List of award winners: British Association Medal (Silver), Southern Africa Association for the Advancement of Science, retrieved 2018-02-11
- Medal Winners (PDF), Royal Society of South Africa, retrieved 2018-02-11
- ICA Medals, Institute of Combinatorics and its Applications, retrieved 2018-02-11