The following pages link to Dieter Rautenbach (Q186196):
Displaying 50 items.
- Dominating sets, packings, and the maximum degree (Q641164) (← links)
- Finite Sholander trees, trees, and their betweenness (Q641185) (← links)
- How to determine if a random graph with a fixed degree sequence has a giant component (Q681521) (← links)
- Reversible iterative graph processes (Q690472) (← links)
- Reconstructing infinite sets of integers (Q696913) (← links)
- A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs (Q697080) (← links)
- Forcing unbalanced complete bipartite minors (Q703605) (← links)
- The maximum size of graphs with a unique \(k\)-factor (Q705753) (← links)
- Interpolating between bounds on the independence number (Q708394) (← links)
- Minimum degree and density of binary sequences (Q709264) (← links)
- Long cycles and paths in distance graphs (Q712275) (← links)
- Mixed unit interval graphs (Q713160) (← links)
- Bounds on the exponential domination number (Q729783) (← links)
- A class of problems for which cyclic relaxation converges linearly (Q732240) (← links)
- Independent domination in subcubic bipartite graphs of girth at least six (Q741773) (← links)
- Polynomial algorithms for kernels in comparability, permutation and \(P_4\)-free graphs (Q816574) (← links)
- Minimum distance-unbalancedness of trees (Q830776) (← links)
- Delay optimization of linear depth Boolean circuits with prescribed input arrival times (Q866541) (← links)
- Reconstructing graphs from size and degree properties of their induced \(k\)-subgraphs (Q868330) (← links)
- Small step-dominating sets in trees (Q870988) (← links)
- On the irregularity of bipartite graphs (Q878643) (← links)
- Cycle lengths of Hamiltonian \(P_\ell\)-free graphs (Q897235) (← links)
- Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs (Q897965) (← links)
- On the geodetic iteration number of distance-hereditary graphs (Q898096) (← links)
- Forbidden induced subgraphs for bounded \(p\)-intersection number (Q898105) (← links)
- \(\alpha \)-domination perfect trees (Q932588) (← links)
- Edge colouring by total labellings (Q960914) (← links)
- Some remarks on the geodetic number of a graph (Q965962) (← links)
- Packing edge-disjoint cycles in graphs and the cyclomatic number (Q968414) (← links)
- Packing disjoint cycles over vertex cuts (Q973127) (← links)
- Exact leaf powers (Q982668) (← links)
- Random procedures for dominating sets in graphs (Q986706) (← links)
- On packing shortest cycles in graphs (Q989491) (← links)
- An \(\Omega (n\log n)\) lower bound for computing the sum of even-ranked elements (Q989536) (← links)
- Binary trees with choosable edge lengths (Q989581) (← links)
- Some remarks on \(\lambda _{p,q}\)-connectedness (Q998437) (← links)
- The independence number in graphs of maximum degree three (Q998471) (← links)
- Domination in bipartite graphs (Q998499) (← links)
- On the OBDD size for graphs of bounded tree- and clique-width (Q1011721) (← links)
- On the existence of edge cuts leaving several large components (Q1024487) (← links)
- Some results on graphs without long induced paths (Q1029004) (← links)
- Edge irregular total labellings for graphs of linear size (Q1043545) (← links)
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers (Q1043551) (← links)
- On spanning tree congestion (Q1044004) (← links)
- A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing (Q1044022) (← links)
- Lower bounds on treespan (Q1044709) (← links)
- Remarks about disjoint dominating sets (Q1045182) (← links)
- An independent dominating set in the complement of a minimum dominating set of a tree (Q1049262) (← links)
- The influence of special vertices on strong domination (Q1292872) (← links)
- On the differences between the upper irredundance, upper domination and independence numbers of a graph (Q1301668) (← links)
