The following pages link to Dieter Rautenbach (Q186196):
Displaying 50 items.
- Induced 2-regular subgraphs in \(k\)-chordal cubic graphs (Q266935) (← links)
- Averaging 2-rainbow domination and Roman domination (Q266967) (← links)
- Largest domination number and smallest independence number of forests with given degree sequence (Q277645) (← links)
- Independence in uniform linear triangle-free hypergraphs (Q279201) (← links)
- Strong equality of Roman and weak Roman domination in trees (Q284830) (← links)
- A lower bound on the independence number of a graph in terms of degrees and local clique sizes (Q298956) (← links)
- Slash and burn on graphs -- firefighting with general weights (Q299037) (← links)
- Near-linear-time algorithm for the geodetic Radon number of grids (Q299103) (← links)
- Extremal values and bounds for the zero forcing number (Q317429) (← links)
- On graphs with induced matching number almost equal to matching number (Q324703) (← links)
- On the cycle spectrum of cubic Hamiltonian graphs (Q354467) (← links)
- Algorithmic and structural aspects of the \(P_3\)-Radon number (Q363552) (← links)
- A short proof of the versatile version of Fleischner's theorem (Q383756) (← links)
- Cycles in squares of trees without generalized claws (Q383769) (← links)
- Recognizing some complementary products (Q389934) (← links)
- On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7 (Q389981) (← links)
- On the Carathéodory number of interval and graph convexities (Q392186) (← links)
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- Extending Berge's and Favaron's results about well-covered graphs (Q394212) (← links)
- Matchings in graphs of odd regularity and girth (Q394288) (← links)
- Domination and total domination in cubic graphs of large girth (Q400535) (← links)
- Independent sets and matchings in subcubic graphs (Q427833) (← links)
- Unit and single point interval graphs (Q427904) (← links)
- An upper bound on the \(P_3\)-Radon number (Q442343) (← links)
- Cycle spectra of Hamiltonian graphs (Q444376) (← links)
- Greedy colorings of words (Q444455) (← links)
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
- Forests and trees among Gallai graphs (Q472964) (← links)
- The circumference of the square of a connected graph (Q484548) (← links)
- Distance \(k\)-domination, distance \(k\)-guarding, and distance \(k\)-vertex cover of maximal outerplanar graphs (Q494436) (← links)
- Brush your trees! (Q494441) (← links)
- Two greedy consequences for maximum induced matchings (Q497673) (← links)
- Exponential domination in subcubic graphs (Q504979) (← links)
- Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability (Q507477) (← links)
- Complexity properties of complementary prisms (Q511681) (← links)
- Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees (Q511918) (← links)
- Some comments on the Slater number (Q526227) (← links)
- Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
- On Hamiltonian paths in distance graphs (Q533446) (← links)
- On finite convexity spaces induced by sets of paths in graphs (Q533760) (← links)
- Recolouring-resistant colourings (Q548277) (← links)
- Irreversible conversion of graphs (Q551200) (← links)
- The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns (Q556857) (← links)
- (Q590229) (redirect page) (← links)
- Bijections for refined restricted permutations (Q598452) (← links)
- Disjoint dominating and total dominating sets in graphs (Q602677) (← links)
- Lower bounds on the independence number of certain graphs of odd girth at least seven (Q617649) (← links)
- Independence in connected graphs (Q617904) (← links)
- Characterization and representation problems for intersection betweennesses (Q628325) (← links)
- Strict betweennesses induced by posets as well as by graphs (Q633221) (← links)
