Ortrud Oellermann

Last updated

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
Ortrud Oellermann
Born
Vryheid
AwardsSilver British Association Medal
Meiring Naude Medal,
Hall Medal
Academic background
Alma mater University of Natal,
Western Michigan University
Thesis Generalized Connectivity in Graphs
Doctoral advisorGary Chartrand

Research articles

Related Research Articles

Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many applications ranging from logic to statistical physics and from evolutionary biology to computer science.

<span class="mw-page-title-main">Noga Alon</span> Israeli mathematician

Noga Alon is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers.

<span class="mw-page-title-main">Cheryl Praeger</span> Australian mathematician

Cheryl Elisabeth Praeger is an Australian mathematician. Praeger received BSc (1969) and MSc degrees from the University of Queensland (1974), and a doctorate from the University of Oxford in 1973 under direction of Peter M. Neumann. She has published widely and has advised 27 PhD students. She is currently Emeritus Professor of Mathematics at the University of Western Australia. She is best known for her works in group theory, algebraic graph theory and combinatorial designs.

<span class="mw-page-title-main">János Pach</span> Hungarian mathematician

János Pach is a mathematician and computer scientist working in the fields of combinatorics and discrete and computational geometry.

<span class="mw-page-title-main">Gary Chartrand</span> American-born mathematician

Gary Theodore Chartrand is an American-born mathematician who specializes in graph theory. He is known for his textbooks on introductory graph theory and for the concept of a highly irregular graph.

<span class="mw-page-title-main">Mehdi Behzad</span> Iranian mathematician (born 1936)

Mehdi Behzad is an Iranian mathematician specializing in graph theory. He introduced his total coloring theory during his Ph.D. studies in 1965. Despite the active work during the last 50 years this conjecture remains as challenging as it is open. In fact, Behzad's conjecture now belongs to mathematics’ classic open problems.

<span class="mw-page-title-main">Watkins snark</span>

In the mathematical field of graph theory, the Watkins snark is a snark with 50 vertices and 75 edges. It was discovered by John J. Watkins in 1989.

<span class="mw-page-title-main">Ronald Gould (mathematician)</span> American mathematician

Ronald James Gould is an American mathematician specializing in combinatorics and graph theory. He is a Goodrich C. White professor emeritus in the Emory University Department of Mathematics.

Michael S. Jacobson is a mathematician, and Professor of Mathematical & Statistical Sciences in the Department of Mathematical & Statistical Science at the University of Colorado Denver. He served as Chair from 2003 to 2012 and was on loan serving as a program director in EHR/DUE at the National Science Foundation.

Michael David Plummer is a retired mathematics professor from Vanderbilt University. His field of work is in graph theory in which he has produced over a hundred papers and publications. He has also spoken at over a hundred and fifty guest lectures around the world.

In graph theory, a highly irregular graph is a graph in which, for every vertex, all neighbors of that vertex have distinct degrees.

Hendrika Cornelia Scott (Henda) SwartFRSSAf was a South African mathematician, a professor emeritus of mathematics at the University of KwaZulu-Natal and a professor at the University of Cape Town

Carolyn Ray Boone Mahoney is an American mathematician who served as president of Lincoln University of Missouri. Her research interests include combinatorics, graph theory, and matroids.

Zdeněk Dvořák is a Czech mathematician specializing in graph theory.

Catherine Greenhill is an Australian mathematician known for her research on random graphs, combinatorial enumeration and Markov chains. She is a professor of mathematics in the School of Mathematics and Statistics at the University of New South Wales, and an editor-in-chief of the Electronic Journal of Combinatorics.

Ermelinda DeLaViña is an American mathematician specializing in graph theory. She is a professor in the Computer and Mathematical Sciences Department of the University of Houston–Downtown, where she is also Associate Dean of the College of Science and Technology.

Ping Zhang is a mathematician specializing in graph theory. She is a professor of mathematics at Western Michigan University and the author of multiple textbooks on graph theory and mathematical proof.

Pamela Estephania Harris is a Mexican-American mathematician, educator and advocate for immigrants. She is currently an associate professor at the University of Wisconsin-Milwaukee in Milwaukee, Wisconsin, was formerly an associate professor at Williams College in Williamstown, Massachusetts and is co-founder of the online platform Lathisms. She is also an editor of the e-mentoring blog of the American Mathematical Society (AMS).

Mirka Miller was a Czech-Australian mathematician and computer scientist interested in graph theory and data security. She was a professor of electrical engineering and computer science at the University of Newcastle.

Christina Eubanks-Turner is a professor of mathematics in the Seaver College of Science and Engineering at Loyola Marymount University (LMU). Her academic areas of interest include graph theory, commutative algebra, mathematics education, and mathematical sciences diversification. She is also the Director of the Master's Program in Teaching Mathematics at LMU.

References

  1. 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, JSTOR   2686701, MR   0931654
  2. 1 2 3 Education, Professional Service, and Administration (PDF), retrieved 2018-02-11
  3. 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 {{citation}}: CS1 maint: multiple names: authors list (link)
  4. Ortrud Oellermann at the Mathematics Genealogy Project
  5. Chartrand, Gary (2016), "Highly irregular", in Gera, Ralucca; Hedetniemi, Stephen; Larson, Craig (eds.), Graph Theory: Favorite Conjectures and Open Problems – 1, Problem Books in Mathematics, Cham: Springer, pp. 1–16, MR   3617180 . See in particular p. 9.
  6. List of award winners: British Association Medal (Silver), Southern Africa Association for the Advancement of Science , retrieved 2018-02-11
  7. Medal Winners (PDF), Royal Society of South Africa , retrieved 2018-02-11
  8. ICA Medals, Institute of Combinatorics and its Applications , retrieved 2018-02-11