6 citations · 24 across the 32 of their papers we have counts for
6 papers · 1 filter
Burning a Graph is Hard
Anthony Bonato, Jeannette Janssen, Elham Roshanbin
Graph burning is a model for the spread of social contagion. The burning number is a graph parameter associated with graph burning that measures the speed of the spread of contagio…
Exponential Domination in Subcubic Graphs
Stéphane Bessy, Pascal Ochem, Dieter Rautenbach
As a natural variant of domination in graphs, Dankelmann et al. [Domination with exponential decay, Discrete Math. 309 (2009) 5877-5883] introduce exponential domination, where ver…
Bounds on the Burning Number
Stéphane Bessy, Anthony Bonato, Jeannette Janssen +1
Motivated by a graph theoretic process intended to measure the speed of the spread of contagion in a graph, Bonato, Janssen, and Roshanbin [Burning a Graph as a Model of Social Con…
Bounds on the Exponential Domination Number
Stephane Bessy, Pascal Ochem, Dieter Rautenbach
As a natural variant of domination in graphs, Dankelmann et al. [Domination with exponential decay, Discrete Math. 309 (2009) 5877-5883] introduce exponential domination, where ver…
On independent set on B1-EPG graphs
Marin Bougeret, Stephane Bessy, Daniel Gonçalves +1
In this paper we consider the Maximum Independent Set problem (MIS) on -EPG graphs. EPG (for Edge intersection graphs of Paths on a Grid) was introduced in ~\cite{edgeintersin…
Colorful paths for 3-chromatic graphs
Bessy Stéphane, Bousquet Nicolas
In this paper, we prove that every 3-chromatic connected graph, except , admits a 3-vertex coloring in which every vertex is the beginning of a 3-chromatic path. It is a speci…