Ortrud R. Oellermann

From MaRDI portal
Person:233441

Available identifiers

zbMath Open oellermann.ortrud-rWikidataQ48482999 ScholiaQ48482999MaRDI QIDQ233441

List of research outcomes

PublicationDate of PublicationType
The threshold dimension and irreducible graphs2022-12-02Paper
The maximum average connectivity among all orientations of a graph2022-04-13Paper
On the Average (Edge-)Connectivity of Minimally $k$-(Edge-)Connected Graphs2022-02-16Paper
The threshold dimension and threshold strong dimension of a graph: a survey2022-02-01Paper
The threshold strong dimension of a graph2021-06-14Paper
Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs2020-12-29Paper
The threshold dimension of a graph2020-10-14Paper
Enumerating the Digitally Convex Sets of Powers of Cycles and Cartesian Products of Paths and Complete Graphs2020-08-06Paper
On the Mean Order of Connected Induced Subgraphs of Block Graphs2020-05-07Paper
Global cycle properties in graphs with large minimum clustering coefficient2019-10-15Paper
Maximizing the mean subtree order2019-08-15Paper
Some of My Favourite Conjectures: Local Conditions Implying Global Cycle Properties2019-06-12Paper
On the Mean Connected Induced Subgraph Order of Cographs2019-01-30Paper
On the roots of Wiener polynomials of graphs2018-07-26Paper
The mean order of sub‐k‐trees of k‐trees2018-07-13Paper
On Saito's conjecture and the Oberly-Sumner conjectures2017-10-11Paper
Comparing the metric and strong dimensions of graphs2017-02-06Paper
Reconstructing trees from digitally convex sets2016-11-24Paper
Generating and enumerating digitally convex sets of trees2016-06-13Paper
Simultaneous resolvability in graph families2016-05-13Paper
Global cycle properties of locally isometric graphs2016-04-07Paper
Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs2016-04-07Paper
The simultaneous metric dimension of graph families2015-12-07Paper
Global properties of graphs with local degree conditions2015-06-12Paper
On the spectrum and number of convex sets in graphs2015-04-01Paper
Graphs with a minimal number of convex sets2015-01-20Paper
On the strong metric dimension of Cartesian and direct products of graphs2014-08-21Paper
https://portal.mardi4nfdi.de/entity/Q52989192013-06-25Paper
https://portal.mardi4nfdi.de/entity/Q30892902011-08-24Paper
m_3^3-Convex geometries are A-free2011-07-06Paper
Hamiltonicity of \(k\)-traceable graphs2011-06-01Paper
Distance in Graphs2010-12-21Paper
https://portal.mardi4nfdi.de/entity/Q35614352010-05-25Paper
On 3-Steiner simplicial orderings2009-12-15Paper
https://portal.mardi4nfdi.de/entity/Q36355582009-07-06Paper
Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs2008-09-04Paper
https://portal.mardi4nfdi.de/entity/Q53102112007-09-21Paper
The strong metric dimension of graphs and digraphs2007-03-02Paper
Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs2007-02-02Paper
https://portal.mardi4nfdi.de/entity/Q34088422006-11-15Paper
The directed path partition conjecture2006-10-16Paper
https://portal.mardi4nfdi.de/entity/Q54883272006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q54883292006-09-14Paper
The partition dimension of Cayley digraphs2006-05-18Paper
The metric dimension of Cayley digraphs2006-03-20Paper
Rebuilding convex sets in graphs2005-09-22Paper
https://portal.mardi4nfdi.de/entity/Q54635202005-08-04Paper
Minimum average distance of strong orientations of graphs2004-11-23Paper
The average connectivity of a digraph2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44575412004-03-25Paper
Bipartite rainbow Ramsey numbers.2004-03-14Paper
On upper domination Ramsey numbers for graphs.2004-01-26Paper
Bounds on the average connectivity of a graph2003-09-09Paper
https://portal.mardi4nfdi.de/entity/Q44059162003-08-25Paper
How to Define an Irregular Graph2002-10-17Paper
The upper domination Ramsey number \(u(3,3,3)\)2002-10-01Paper
https://portal.mardi4nfdi.de/entity/Q45521542002-08-29Paper
The average connectivity of a graph2002-08-29Paper
Augmenting trees so that every three vertices lie on a cycle2002-08-08Paper
https://portal.mardi4nfdi.de/entity/Q27681322002-06-03Paper
https://portal.mardi4nfdi.de/entity/Q27125152002-01-08Paper
https://portal.mardi4nfdi.de/entity/Q45048972001-03-30Paper
Resolvability in graphs and the metric dimension of a graph2001-02-27Paper
Bipartite Ramsey numbers and Zarankiewicz numbers2000-06-21Paper
https://portal.mardi4nfdi.de/entity/Q49348682000-01-30Paper
Bounds on the size of graphs of given order and \(l\)-connectivity1999-11-23Paper
https://portal.mardi4nfdi.de/entity/Q42282111999-08-10Paper
https://portal.mardi4nfdi.de/entity/Q43932421999-01-14Paper
The irregularity cost of a graph1998-11-17Paper
https://portal.mardi4nfdi.de/entity/Q43877211998-08-10Paper
Steiner intervals in graphs1998-03-25Paper
A characterization of 3-Steiner distance hereditary graphs1998-01-12Paper
On the average Steiner distance of graphs with presribed properties1998-01-07Paper
The diversity of domination1997-09-15Paper
https://portal.mardi4nfdi.de/entity/Q43462381997-08-03Paper
Local edge domination critical graphs1997-06-09Paper
On the Steiner median of a tree1996-11-25Paper
The average Steiner distance of a graph1996-11-03Paper
An algorithm to find two distance domination parameters in a graph1996-10-06Paper
https://portal.mardi4nfdi.de/entity/Q48710731996-08-26Paper
https://portal.mardi4nfdi.de/entity/Q48634821996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48738291996-04-22Paper
From steiner centers to steiner medians1996-03-31Paper
https://portal.mardi4nfdi.de/entity/Q48487831996-01-28Paper
Steiner distance stable graphs1995-03-20Paper
Steiner Distance-Hereditary Graphs1995-01-26Paper
https://portal.mardi4nfdi.de/entity/Q43131881994-12-05Paper
On the \(l\)-connectivity of a digraph1994-10-10Paper
https://portal.mardi4nfdi.de/entity/Q43017541994-08-14Paper
WHICH TREES ARE UNIQUELY FRAMED BY THE HEAWOOD GRAPH?1994-04-21Paper
SOME GENERAL ASPECTS OF THE FRAMING NUMBER OF A GRAPH1994-04-21Paper
https://portal.mardi4nfdi.de/entity/Q42880871994-04-21Paper
https://portal.mardi4nfdi.de/entity/Q46933831993-11-26Paper
The irregularity cost or sum of a graph1993-08-19Paper
https://portal.mardi4nfdi.de/entity/Q40299741993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40299821993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q39870521992-06-28Paper
On multipartite tournaments1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39766351992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39766391992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39805651992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39721291992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39725101992-06-25Paper
Conditional graph connectivity relative to hereditary properties1991-01-01Paper
Steiner centers in graphs1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34721271990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34746711990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34800761990-01-01Paper
Steiner Numbers in Graphs1990-01-01Paper
Greatest common subgroups with specified properties1989-01-01Paper
A Matter of Degree1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34900401989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42054561989-01-01Paper
Steiner distance in graphs1989-01-01Paper
Variations on a theorem of Petersen1988-01-01Paper
The connected cutset connectivity of a graph1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38221951988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38244551988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38280251988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38310441988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42054591988-01-01Paper
On the \(\ell\)-connectivity of a graph1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37817921987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37841081987-01-01Paper
On maximum matchings in cubic graphs with a bounded number of bridge-covering paths1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38031481987-01-01Paper
Highly irregular graphs1987-01-01Paper
Connected graphs containing a given connected graph as a unique greatest common subgraph1986-01-01Paper
Bipartite regulation numbers1986-01-01Paper
An Eulerian exposition1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38015921986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38047311986-01-01Paper
Randomly n-cyclic digraphs1985-01-01Paper
On the regulation number of a multigraph1985-01-01Paper
Graphs for which all strong orientations are Eulerian1984-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Ortrud R. Oellermann