1 citations · 2 across the 2 of their papers we have counts for
6 papers · 1 filter
Rainbow triangles and cliques in edge-colored graphs
Stefan Ehard, Elena Mohr
For an edge-colored graph, a subgraph is called rainbow if all its edges have distinct colors. We show that if is an edge-colored graph of order and size using colo…
On some tractable and hard instances for partial incentives and target set selection
Stefan Ehard, Dieter Rautenbach
A widely studied model for influence diffusion in social networks are {\it target sets}. For a graph and an integer-valued threshold function on its vertex set, a {\it targ…
On the extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives
S. Ehard, D. Rautenbach
The famous lower bound on the independence number of a graph due to Caro and Wei is known to be tight if and only if the co…
Dynamic monopolies for interval graphs with bounded thresholds
Stéphane Bessy, Stefan Ehard, Lucia D. Penso +1
For a graph and an integer-valued threshold function on its vertex set, a dynamic monopoly is a set of vertices of such that iteratively adding to it vertices of $G…
Partial immunization of trees
Mitre C. Dourado, Stefan Ehard, Lucia D. Penso +1
For a graph and an integer-valued function on its vertex set, a dynamic monopoly is a set of vertices of such that iteratively adding to it vertices of that hav…
Vaccinate your trees!
Stefan Ehard, Dieter Rautenbach
For a graph and an integer-valued function on its vertex set, a dynamic monopoly is a set of vertices of such that iteratively adding to it vertices of that hav…