The following pages link to Dieter Rautenbach (Q186196):
Displaying 50 items.
- Total irredundance in graphs (Q1849917) (← links)
- On parameters related to strong and weak domination in graphs (Q1850037) (← links)
- Total domination supercritical graphs with respect to relative complements (Q1850074) (← links)
- Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs (Q1855399) (← links)
- On the reconstruction of the degree sequence (Q1861223) (← links)
- Independent domination and matchings in graphs (Q1861228) (← links)
- Reconstruction up to isometries (Q1861229) (← links)
- Remarks on the bondage number of planar graphs (Q1861243) (← links)
- Maximum graphs with a unique minimum dominating set (Q1861257) (← links)
- Wagner's conjecture and the graph-minor project (Q1861446) (← links)
- Almost-spanning subgraphs with bounded degree in dense graphs (Q1864574) (← links)
- On a reconstruction problem of Harary and Manvel (Q1865368) (← links)
- Factor domination and minimum degree (Q1868841) (← links)
- On paths and cycles dominating hypercubes (Q1868842) (← links)
- Extremal subgraphs with respect to vertex degree bounds (Q1869226) (← links)
- On the numbers of orbits of permutations under an operator related to Eulerian numbers (Q1880358) (← links)
- On a problem of Cameron's on inexhaustible graphs (Q1882142) (← links)
- Rooted minor problems in highly connected graphs (Q1886348) (← links)
- Total domination subdivision numbers of trees (Q1887637) (← links)
- The diameter of total domination vertex critical graphs (Q1887647) (← links)
- Symbolic moment calculus. I: Foundations and permutation pattern statistics (Q1890407) (← links)
- On the convexity number of graphs (Q1926045) (← links)
- Pairs of disjoint dominating sets in connected cubic graphs (Q1926047) (← links)
- Characterization and recognition of Radon-independent sets in split graphs (Q1941699) (← links)
- Open packing, total domination, and the \(P_3\)-Radon number (Q1947007) (← links)
- Integral mixed unit interval graphs (Q1949108) (← links)
- Pairs of disjoint dominating sets and the minimum degree of graphs (Q1959712) (← links)
- Bounds on the strong domination number (Q1974534) (← links)
- On card shuffling, a mathematical menu (Q1976818) (← links)
- On matching numbers of tree and bipartite degree sequences (Q1999734) (← links)
- On some tractable and hard instances for partial incentives and target set selection (Q2010927) (← links)
- Graphs of interval count two with a given partition (Q2015148) (← links)
- Approximating maximum acyclic matchings by greedy and local search strategies (Q2019502) (← links)
- Geodetic convexity parameters for \((q, q - 4)\)-graphs (Q2030436) (← links)
- Exponential independence in subcubic graphs (Q2032859) (← links)
- Reconfiguring dominating sets in minor-closed graph classes (Q2053687) (← links)
- On Hamiltonian cycles in claw-free cubic graphs (Q2062689) (← links)
- Maximally distance-unbalanced trees (Q2065663) (← links)
- The hull number in the convexity of induced paths of order \(3\) (Q2077392) (← links)
- Relating dissociation, independence, and matchings (Q2081478) (← links)
- Additive tree \(O(\rho \log n)\)-spanners from tree breadth \(\rho \) (Q2124229) (← links)
- Algorithmic aspects of broadcast independence (Q2127617) (← links)
- Identifying codes in the complementary prism of cycles (Q2132351) (← links)
- Acyclic matchings in graphs of bounded maximum degree (Q2138980) (← links)
- Factorially many maximum matchings close to the Erdős-Gallai bound (Q2152791) (← links)
- Zero-sum copies of spanning forests in zero-sum complete graphs (Q2162505) (← links)
- Equating \(\kappa\) maximum degrees in graphs without short cycles (Q2175241) (← links)
- Constant threshold intersection graphs of orthodox paths in trees (Q2184664) (← links)
- Approximating connected safe sets in weighted trees (Q2184684) (← links)
- Domination versus edge domination (Q2197443) (← links)
