The following pages link to Dieter Rautenbach (Q186196):
Displaying 50 items.
- On Kelly's lemma for infinite sets of integers (Q1348131) (← links)
- A group testing problem for graphs with several defective edges (Q1348382) (← links)
- On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs (Q1406558) (← links)
- Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees (Q1408460) (← links)
- A note on trees of maximum weight and restricted degrees (Q1408895) (← links)
- A note on the reconstruction of sets of finite measure (Q1416140) (← links)
- The domatic number of block-cactus graphs (Q1584305) (← links)
- A characterization of \(\Gamma\alpha(k)\)-perfect graphs (Q1586777) (← links)
- Upper bounds for the \(k\)-subdomination number of graphs (Q1598803) (← links)
- Disjoint subgraphs of large maximum degree (Q1598819) (← links)
- Sparse universal graphs (Q1612288) (← links)
- A note on minimum degree conditions for supereulerian graphs (Q1613362) (← links)
- An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard (Q1613386) (← links)
- Wiener index versus maximum degree in trees (Q1613418) (← links)
- Weighted domination in triangle-free graphs (Q1613448) (← links)
- Reconstructing infinite objects (Q1613458) (← links)
- Domination graphs of regular tournaments (Q1613487) (← links)
- Approximately locating an invisible agent in a graph with relative distance queries (Q1637147) (← links)
- A lower bound on the acyclic matching number of subcubic graphs (Q1637156) (← links)
- And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288) (← links)
- Maximal determinants of combinatorial matrices (Q1641998) (← links)
- The repeater tree construction problem (Q1675870) (← links)
- Corrigendum to ``Complexity analysis of \(P_{3}\)-convexity problems on bounded-degree and planar graphs'' (Q1680540) (← links)
- Bounds on the burning number (Q1682876) (← links)
- Uniquely restricted matchings and edge colorings (Q1687907) (← links)
- Hereditary equality of domination and exponential domination (Q1692649) (← links)
- Some bounds on the zero forcing number of a graph (Q1693145) (← links)
- The cat and the noisy mouse (Q1699546) (← links)
- Locally searching for large induced matchings (Q1704586) (← links)
- Degenerate matchings and edge colorings (Q1706114) (← links)
- On the hardness of finding the geodetic number of a subcubic graph (Q1708262) (← links)
- On the maximum number of minimum dominating sets in forests (Q1727765) (← links)
- Forcing brushes (Q1730262) (← links)
- Lower bounds on the uniquely restricted matching number (Q1733882) (← links)
- Dynamic monopolies for interval graphs with bounded thresholds (Q1741518) (← links)
- Relating domination, exponential domination, and porous exponential domination (Q1751208) (← links)
- On the maximum number of maximum independent sets (Q1756132) (← links)
- On the geodetic Radon number of grids (Q1759818) (← links)
- A note on the number of matchings and independent sets in trees (Q1765528) (← links)
- Rectilinear spanning trees versus bounding boxes (Q1773175) (← links)
- Propagation of mean degrees (Q1773176) (← links)
- Cuts leaving components of given minimum order (Q1773356) (← links)
- On some graphs with a unique perfect matching (Q1799576) (← links)
- A linear-programming approach to the generalized Randić index (Q1811120) (← links)
- The number of graphs without forbidden subgraphs (Q1826950) (← links)
- Maximum sizes of graphs with given domination parameters (Q1827704) (← links)
- Competition polysemy (Q1827753) (← links)
- The solution of two problems on bound polysemy (Q1827754) (← links)
- Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
- Perfect graphs of strong domination and independent strong domination (Q1841911) (← links)
