S. Bessy

activity

20082026

most citedBurning a Graph is Hard

6 citations · 24 across the 32 of their papers we have counts for

collaborators

Showing 2018 · math.COShow all

3 papers · 2 filters

math.CO2018

Girth, minimum degree, independence, and broadcast independence

Stéphane Bessy, Dieter Rautenbach

An independent broadcast on a connected graph $G$ is a function $f : V (G) \to N_{0}$ such that, for every vertex $x$ of $G$ , the value $f (x)$ is at most the eccentricity of $x$ …

math.CO2018

Relating broadcast independence and independence

Stéphane Bessy, Dieter Rautenbach

An independent broadcast on a connected graph $G$ is a function $f : V (G) \to N_{0}$ such that, for every vertex $x$ of $G$ , the value $f (x)$ is at most the eccentricity of $x$ …

math.CO2018

Algorithmic aspects of broadcast independence

Stéphane Bessy, Dieter Rautenbach

An independent broadcast on a connected graph $G$ is a function $f : V (G) \to N_{0}$ such that, for every vertex $x$ of $G$ , the value $f (x)$ is at most the eccentricity of $x$ …