default search action
Ortrud R. Oellermann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j81]Johan P. de Wet
, Jean E. Dunbar, Marietjie Frick
On the Strong Path Partition Conjecture. Discuss. Math. Graph Theory 44(2): 691 (2024) - 2023
- [j80]Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann
The threshold dimension and irreducible graphs. Discuss. Math. Graph Theory 43(1): 195-210 (2023) - [j79]MacKenzie Carr, Christina M. Mynhardt
Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs. Discuss. Math. Graph Theory 43(3): 859-874 (2023) - 2022
- [j78]Lucas Mol, Ortrud R. Oellermann, Vibhav Oswal:
On the average (edge-)connectivity of minimally k-(edge-)connected graphs. Bull. ICA 94: 95-110 (2022) - [j77]Rocío M. Casablanca, Peter Dankelmann, Wayne Goddard, Lucas Mol
The maximum average connectivity among all orientations of a graph. J. Comb. Optim. 43(3): 543-570 (2022) - 2021
- [j76]Rocío M. Casablanca, Lucas Mol, Ortrud R. Oellermann:
Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs. Discret. Appl. Math. 289: 233-247 (2021) - [j75]Nadia Benakli
The threshold strong dimension of a graph. Discret. Math. 344(7): 112402 (2021) - [i2]Lucas Mol, Ortrud R. Oellermann, Vibhav Oswal:
On the Average (Edge-)Connectivity of Minimally k-(Edge-)Connected Graphs. CoRR abs/2106.04083 (2021) - 2020
- [j74]Kristaps J. Balodis, Lucas Mol, Ortrud R. Oellermann, Matthew E. Kroeker:
On the mean order of connected induced subgraphs of block graphs. Australas. J Comb. 76: 128-148 (2020) - [j73]Lucas Mol
The threshold dimension of a graph. Discret. Appl. Math. 287: 118-133 (2020) - [i1]Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann:
The Threshold Dimension and Irreducible Graphs. CoRR abs/2002.11048 (2020)
2010 – 2019
- 2019
- [j72]Lucas Mol
Maximizing the mean subtree order. J. Graph Theory 91(4): 326-352 (2019) - 2018
- [j71]Matthew E. Kroeker, Lucas Mol, Ortrud R. Oellermann:
On the mean connected induced subgraph order of cographs. Australas. J Comb. 71: 161- (2018) - [j70]Jason I. Brown
On the roots of Wiener polynomials of graphs. Discret. Math. 341(9): 2398-2408 (2018) - [j69]Alexander M. Stephens, Ortrud R. Oellermann
The mean order of sub-k-trees of k-trees. J. Graph Theory 88(1): 61-79 (2018) - 2017
- [j68]Philip Lafrance, Ortrud R. Oellermann, Timothy Pressey:
Reconstructing trees from digitally convex sets. Discret. Appl. Math. 216: 254-260 (2017) - [j67]Gaia Moravcik, Ortrud R. Oellermann
Comparing the metric and strong dimensions of graphs. Discret. Appl. Math. 220: 68-79 (2017) - [j66]Susan A. van Aardt, Jean E. Dunbar, Marietjie Frick
On Saito's Conjecture and the Oberly-Sumner Conjectures. Graphs Comb. 33(4): 583-594 (2017) - 2016
- [j65]Yunior Ramírez-Cruz
The simultaneous metric dimension of graph families. Discret. Appl. Math. 198: 241-250 (2016) - [j64]Adam Borchert, Skylar Nicol, Ortrud R. Oellermann:
Global cycle properties of locally isometric graphs. Discret. Appl. Math. 205: 16-26 (2016) - [j63]Susan A. van Aardt, Marietjie Frick
Global cycle properties in locally connected, locally traceable and locally hamiltonian graphs. Discret. Appl. Math. 205: 171-179 (2016) - [j62]Philip Lafrance, Ortrud R. Oellermann, Timothy Pressey:
Generating and Enumerating Digitally Convex Sets of Trees. Graphs Comb. 32(2): 721-732 (2016) - 2015
- [j61]Jason I. Brown
On the spectrum and number of convex sets in graphs. Discret. Math. 338(7): 1144-1153 (2015) - 2014
- [j60]Juan Alberto Rodríguez-Velázquez
On the strong metric dimension of Cartesian and direct products of graphs. Discret. Math. 335: 8-19 (2014) - [j59]Yunior Ramírez-Cruz
Simultaneous Resolvability in Graph Families. Electron. Notes Discret. Math. 46: 241-248 (2014) - [j58]Jason I. Brown
Graphs with a Minimal Number of Convex Sets. Graphs Comb. 30(6): 1383-1397 (2014) - 2012
- [j57]Morten Hegner Nielsen, Ortrud R. Oellermann:
Separation properties of 3-Steiner and 3-monophonic convexity in graphs. Discret. Math. 312(22): 3293-3305 (2012) - [j56]José Cáceres, Ortrud R. Oellermann, María Luz Puertas
Minimal trees and monophonic convexity. Discuss. Math. Graph Theory 32(4): 685-704 (2012) - 2011
- [j55]Frank Bullock, Peter Dankelmann, Marietjie Frick, Michael A. Henning, Ortrud R. Oellermann, Susan A. van Aardt:
Hamiltonicity of k-Traceable Graphs. Electron. J. Comb. 18(1) (2011) - [j54]Morten Hegner Nielsen, Ortrud R. Oellermann:
Helly theorems for 3-Steiner and 3-monophonic convexity in graphs. Discret. Math. 311(10-11): 872-880 (2011) - [p1]Wayne Goddard, Ortrud R. Oellermann:
Distance in Graphs. Structural Analysis of Complex Networks 2011: 49-72 - 2010
- [j53]Susan A. van Aardt, Jean E. Dunbar, Marietjie Frick
Traceability of k-traceable oriented graphs. Discret. Math. 310(8): 1325-1333 (2010)
2000 – 2009
- 2009
- [j52]José Cáceres, Ortrud R. Oellermann:
On 3-Steiner simplicial orderings. Discret. Math. 309(19): 5828-5833 (2009) - [j51]Michael A. Henning, Morten Hegner Nielsen, Ortrud R. Oellermann:
Local Steiner convexity. Eur. J. Comb. 30(5): 1186-1193 (2009) - [j50]Morten Hegner Nielsen, Ortrud R. Oellermann:
Steiner Trees and Convex Geometries. SIAM J. Discret. Math. 23(2): 680-693 (2009) - 2008
- [j49]Marietjie Frick, Susan A. van Aardt, Jean E. Dunbar, Morten Hegner Nielsen, Ortrud R. Oellermann:
A Traceability Conjecture for Oriented Graphs. Electron. J. Comb. 15(1) (2008) - [j48]Linda Eroh, Ortrud R. Oellermann:
Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs. Discret. Math. 308(18): 4212-4220 (2008) - 2007
- [j47]Ortrud R. Oellermann, Joel Peters-Fransen:
The strong metric dimension of graphs and digraphs. Discret. Appl. Math. 155(3): 356-364 (2007) - [j46]Ortrud R. Oellermann, María Luz Puertas
Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs. Discret. Math. 307(1): 88-96 (2007) - 2006
- [j45]Ortrud R. Oellermann, Charlene D. Pawluck, Anna Stokke:
The Metric Dimension of Cayley Digraphs of Abelian Groups. Ars Comb. 81 (2006) - [j44]Melodie Fehr, Shonda Gosselin, Ortrud R. Oellermann:
The metric dimension of Cayley digraphs. Discret. Math. 306(1): 31-41 (2006) - 2005
- [j43]Peter Dankelmann, Ortrud R. Oellermann:
Degree Sequences of Optimally Edge-Connected Multigraphs. Ars Comb. 77 (2005) - [j42]José Cáceres, Alberto Márquez
Rebuilding convex sets in graphs. Discret. Math. 297(1-3): 26-37 (2005) - [j41]Marietjie Frick, Susan A. van Aardt, Gcina Dlamini, Jean E. Dunbar, Ortrud R. Oellermann:
The directed path partition conjecture. Discuss. Math. Graph Theory 25(3): 331-343 (2005) - 2004
- [j40]Michael A. Henning, Ortrud Oellermann:
Metric-Locating-Dominating Sets in Graphs. Ars Comb. 73 (2004) - [j39]Michael A. Henning, Ortrud Oellermann:
The average connectivity of a digraph. Discret. Appl. Math. 140(1-3): 143-153 (2004) - [j38]Peter Dankelmann
Minimum average distance of strong orientations of graphs. Discret. Appl. Math. 143(1-3): 204-212 (2004) - [j37]Michael A. Henning, Ortrud Oellermann:
On upper domination Ramsey numbers for graphs. Discret. Math. 274(1-3): 125-135 (2004) - [j36]Linda Eroh, Ortrud Oellermann:
Bipartite rainbow Ramsey numbers. Discret. Math. 277(1-3): 57-72 (2004) - 2003
- [j35]Peter Dankelmann, Ortrud Oellermann:
Bounds on the average connectivity of a graph. Discret. Appl. Math. 129(2-3): 305-318 (2003) - 2002
- [j34]Peter Dankelmann
Augmenting trees so that every three vertices lie on a cycle. Discret. Appl. Math. 116(1-2): 145-159 (2002) - [j33]Michael A. Henning, Ortrud Oellermann:
The upper domination Ramsey number u(3, 3, 3). Discret. Math. 242(1-3): 103-113 (2002) - [j32]Lowell W. Beineke, Ortrud Oellermann, Raymond E. Pippert:
The average connectivity of a graph. Discret. Math. 252(1-3): 31-45 (2002) - 2001
- [j31]Michael A. Henning, Ortrud R. Oellermann:
The average connectivity of regular multipartite tournaments. Australas. J Comb. 23: 101-114 (2001) - 2000
- [j30]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): 99-113 (2000) - [j29]Wayne Goddard, Michael A. Henning, Ortrud R. Oellermann:
Bipartite Ramsey numbers and Zarankiewicz numbers. Discret. Math. 219(1-3): 85-95 (2000)
1990 – 1999
- 1999
- [j28]Wayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart:
Bounds on the Total Redundance and Efficiency of a Graph. Ars Comb. 54 (1999) - [j27]David P. Day, Ortrud R. Oellermann, Henda C. Swart:
Bounds on the size of graphs of given order and up/down-connectivity. Discret. Math. 197-198: 217-223 (1999) - [j26]Ortrud Oellermann:
On Steiner centers and Steiner medians of graphs. Networks 34(4): 258-263 (1999) - 1998
- [j25]Ewa M. Kubicka, Grzegorz Kubicki, Ortrud Oellermann:
Steiner Intervals in Graphs. Discret. Appl. Math. 81(1-3): 181-190 (1998) - 1997
- [j24]Peter Dankelmann, Henda C. Swart, Ortrud Oellermann:
On the Average Steiner Distance of Graphs with Prescribed Properties. Discret. Appl. Math. 79(1-3): 91-103 (1997) - [j23]David P. Day, Ortrud Oellermann, Henda C. Swart:
A characterization of 3-Steiner distance hereditary graphs. Networks 30(4): 243-253 (1997) - 1996
- [j22]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): 85-91 (1996) - [j21]Lowell W. Beineke, Ortrud Oellermann, Raymond E. Pippert:
on the Steiner Median of a Tree. Discret. Appl. Math. 68(3): 249-258 (1996) - [j20]Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart:
The diversity of domination. Discret. Math. 161(1-3): 161-173 (1996) - [j19]Michael A. Henning, Ortrud R. Oellermann, Henda C. Swart:
Local edge domination critical graphs. Discret. Math. 161(1-3): 175-184 (1996) - [j18]Peter Dankelmann, Ortrud R. Oellermann, Henda C. Swart:
The average Steiner distance of a graph. J. Graph Theory 22(1): 15-22 (1996) - 1995
- [j17]Ortrud Oellermann, Jeremy P. Spinrad:
A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance Hereditary. Inf. Process. Lett. 55(3): 149-154 (1995) - [j16]Ortrud R. Oellermann:
From steiner centers to steiner medians. J. Graph Theory 20(2): 113-122 (1995) - 1994
- [j15]David P. Day, Ortrud R. Oellermann, Henda C. Swart:
On the l-connectivity of a diagraph. Discret. Math. 127(1-3): 95-104 (1994) - [j14]Wayne Goddard, Ortrud R. Oellermann, Henda C. Swart:
Steiner distance stable graphs. Discret. Math. 132(1-3): 65-73 (1994) - [j13]David P. Day, Ortrud Oellermann, Henda C. Swart:
Steiner Distance-Hereditary Graphs. SIAM J. Discret. Math. 7(3): 437-442 (1994) - 1991
- [j12]Wayne Goddard, Grzegorz Kubicki, Ortrud R. Oellermann, Songlin Tian:
On multipartite tournaments. J. Comb. Theory B 52(2): 284-300 (1991) - [j11]Ortrud R. Oellermann:
Conditional graph connectivity relative to hereditary properties. Networks 21(2): 245-255 (1991) - 1990
- [j10]Ortrud R. Oellermann, Songlin Tian:
Steiner centers in graphs. J. Graph Theory 14(5): 585-597 (1990)
1980 – 1989
- 1989
- [j9]Gary Chartrand, Ortrud R. Oellermann, Farrokh Saba, Hung Bin Zou:
Greatest common subgraphs with specified properties. Graphs Comb. 5(1): 1-14 (1989) - [j8]Gary Chartrand, Héctor Hevia, Ortrud Oellermann, Farrokh Saba, Allen J. Schwenk:
A Matter of Degree. SIAM J. Discret. Math. 2(4): 456-466 (1989) - 1988
- [j7]Ortrud R. Oellermann:
The connected cutset connectivity of a graph. Discret. Math. 69(3): 301-308 (1988) - 1987
- [j6]Ortrud R. Oellermann:
On thel-connectivity of a graph. Graphs Comb. 3(1): 285-291 (1987) - [j5]Yousef Alavi, Gary Chartrand, Fan R. K. Chung, Paul Erdös, Ronald L. Graham, Ortrud R. Oellermann:
Highly irregular graphs. J. Graph Theory 11(2): 235-249 (1987) - 1986
- [j4]Yousef Alavi, Gary Chartrand, Ortrud R. Oellermann, Linda M. Lesniak:
Bipartite regulation numbers. Discret. Math. 62(2): 113-118 (1986) - [j3]Linda M. Lesniak, Ortrud R. Oellermann:
An Eulerian exposition. J. Graph Theory 10(3): 277-297 (1986) - 1985
- [j2]Gary Chartrand, Ortrud R. Oellermann, Sergio Ruiz:
Randomlyn-cyclic digraphs. Graphs Comb. 1(1): 29-40 (1985) - [j1]Gary Chartrand, Frank Harary, Ortrud R. Oellermann:
On the regulation number of a multigraph. Graphs Comb. 1(1): 137-144 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: