The following pages link to Ortrud R. Oellermann (Q233441):
Displaying 50 items.
- Global cycle properties of locally isometric graphs (Q266915) (← links)
- Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs (Q266958) (← links)
- Simultaneous resolvability in graph families (Q283715) (← links)
- Generating and enumerating digitally convex sets of trees (Q295254) (← links)
- The crossing number of chordal ring networks (Q313472) (← links)
- Reconstructing trees from digitally convex sets (Q344865) (← links)
- On the strong metric dimension of Cartesian and direct products of graphs (Q400431) (← links)
- Independent sets in direct products of vertex-transitive graphs (Q414657) (← links)
- Graphs with a minimal number of convex sets (Q489304) (← links)
- Comparing the metric and strong dimensions of graphs (Q507581) (← links)
- Hamiltonicity of \(k\)-traceable graphs (Q540049) (← links)
- (Q588256) (redirect page) (← links)
- The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
- Cayley graphs and \(G\)-graphs: some applications (Q651882) (← links)
- A new recursive theorem on \(n\)-extendibility (Q675894) (← links)
- Highly irregular digraphs (Q686429) (← links)
- Bounded degrees and prescribed distances in graphs (Q686447) (← links)
- Planar graphs and greatest common subgraphs (Q687720) (← links)
- On the roots of Wiener polynomials of graphs (Q724845) (← links)
- Graphs for which all strong orientations are Eulerian (Q789400) (← links)
- The metric dimension of Cayley digraphs (Q817748) (← links)
- Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs (Q861797) (← links)
- Degree conditions for Hamiltonicity: counting the number of missing edges (Q868355) (← links)
- The strong metric dimension of graphs and digraphs (Q868391) (← links)
- The simultaneous metric dimension of graph families (Q897612) (← links)
- Variations on a theorem of Petersen (Q909672) (← links)
- The Hamilton spaces of Cayley graphs on abelian groups (Q912863) (← links)
- Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs (Q941349) (← links)
- The Euclidean dimension of the join of two cycles (Q998454) (← links)
- Geodetic sets and Steiner sets in graphs (Q1043600) (← links)
- Tight spans of distances and the dual fractionality of undirected multiflow problems (Q1044206) (← links)
- On 3-Steiner simplicial orderings (Q1045119) (← links)
- Randomly n-cyclic digraphs (Q1065824) (← links)
- Faktoren in unendlichen Graphen. (Factors in infinite graphs) (Q1066919) (← links)
- On the regulation number of a multigraph (Q1068843) (← links)
- On shortest cocycle covers of graphs (Q1070245) (← links)
- Compatible path-cycle-decompositions of plane graphs (Q1084113) (← links)
- Distance-hereditary graphs (Q1084114) (← links)
- Connected graphs containing a given connected graph as a unique greatest common subgraph (Q1087564) (← links)
- Bipartite regulation numbers (Q1088677) (← links)
- On the \(\ell\)-connectivity of a graph (Q1094432) (← links)
- Clique covering of graphs (Q1100482) (← links)
- The connected cutset connectivity of a graph (Q1101465) (← links)
- (Q1115452) (redirect page) (← links)
- Generalizaions of critical connectivity of graphs (Q1115453) (← links)
- Maximal chordal subgraphs (Q1115455) (← links)
- Greatest common subgroups with specified properties (Q1119602) (← links)
- On orientations and shortest paths (Q1123899) (← links)
- Elementary proofs of (relatively) recent characterizations of Eulerian graphs (Q1124607) (← links)
- (Q1179274) (redirect page) (← links)