The following pages link to Ortrud R. Oellermann (Q233441):
Displaying 50 items.
- Neighborhood conditions and edge-disjoint perfect matchings (Q1179275) (← links)
- On multipartite tournaments (Q1179479) (← links)
- Directed star decompositions of directed multigraphs (Q1183974) (← links)
- Lattices of cuts in graphs (Q1187152) (← links)
- Bounded graphs (Q1191915) (← links)
- On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs (Q1196745) (← links)
- Indecomposable regular graphs and hypergraphs (Q1197014) (← links)
- Principal common divisors of graphs (Q1209724) (← links)
- Induced matchings (Q1262877) (← links)
- On the existence of a matching orthogonal to a 2-factorization (Q1262879) (← links)
- Bounds on the size of graphs of given order and \(l\)-connectivity (Q1292831) (← links)
- Regularizing irregular graphs (Q1310226) (← links)
- On the rotation distance of graphs (Q1318800) (← links)
- On the \(l\)-connectivity of a digraph (Q1322219) (← links)
- Steiner distance stable graphs (Q1336650) (← links)
- On the ascending star subgraphs decomposition of star forests (Q1340139) (← links)
- Disjoint odd integer subsets having a constant even sum (Q1343783) (← links)
- The diversity of domination (Q1356420) (← links)
- Local edge domination critical graphs (Q1356421) (← links)
- Intersection numbers of bipartite distance-regular graphs (Q1356549) (← links)
- On cycles through a given vertex in multipartite tournaments (Q1356700) (← links)
- Highly irregular graphs with extreme numbers of edges (Q1356711) (← links)
- Irregularity strength of the toroidal grid (Q1356786) (← links)
- On the average Steiner distance of graphs with presribed properties (Q1372733) (← links)
- On distinct distance sets in a graph (Q1377770) (← links)
- Edge frames of graphs: A graph embedding problem (Q1377875) (← links)
- Steiner intervals in graphs (Q1382264) (← links)
- The irregularity cost of a graph (Q1388975) (← links)
- On Hamilton cycle decompositions of the tensor product of complete graphs (Q1398255) (← links)
- Bounds on the average connectivity of a graph (Q1406026) (← links)
- On upper domination Ramsey numbers for graphs. (Q1421516) (← links)
- Bipartite rainbow Ramsey numbers. (Q1426110) (← links)
- Bipartite Ramsey numbers and Zarankiewicz numbers (Q1567662) (← links)
- Resolvability in graphs and the metric dimension of a graph (Q1582071) (← links)
- The average connectivity of a graph (Q1613484) (← links)
- One sufficient condition for Hamiltonian graphs involving distances (Q1759263) (← links)
- On uniquely intersectable graphs (Q1817570) (← links)
- A construction of thickness-minimal graphs (Q1820166) (← links)
- Graphs G for which G and \(\bar G\) are both semidecomposable (Q1820170) (← links)
- On forcibly hereditary P-graphical sequences (Q1820175) (← links)
- The average connectivity of a digraph (Q1827842) (← links)
- The numbers of dependent \(k\)-sets in a graph are log concave (Q1850583) (← links)
- Distance graphs with finite chromatic number (Q1850605) (← links)
- A note about the dominating circuit conjecture (Q1861225) (← links)
- Independent domination and matchings in graphs (Q1861228) (← links)
- Total domination excellent trees (Q1869221) (← links)
- Minimum average distance of strong orientations of graphs (Q1887055) (← links)
- Irredundance perfect graphs (Q1896349) (← links)
- Supereulerian graphs and excluded induced minors (Q1903724) (← links)
- An algorithm to find two distance domination parameters in a graph (Q1917347) (← links)
