20 citations · 22 across the 6 of their papers we have counts for
16 papers · 1 filter
On the Broadcast Independence Number of Circulant Graphs
Abdelamin Laouar, Isma Bouchemakh, Eric Sopena
An independent broadcast on a graph is a function such that for every vertex , where $\operat…
(α, β)-Modules in Graphs
Michel Habib, Lalla Mouatadid, Eric Sopena +1
Modular Decomposition focuses on repeatedly identifying a module M (a collection of vertices that shares exactly the same neighbourhood outside of M) and collapsing it into a singl…
On the signed chromatic number of some classes of graphs
Julien Bensmail, Sandip Das, Soumen Nandi +3
A signed graph is a graph along with a function . A closed walk of a signed graph is positive (resp., negative) if it has an even (resp., odd) num…
Exact square coloring of subcubic planar graphs
Florent Foucaud, Hervé Hocquard, Suchismita Mishra +4
We study the exact square chromatic number of subcubic planar graphs. An exact square coloring of a graph G is a vertex-coloring in which any two vertices at distance exactly 2 rec…
Further Evidence Towards the Multiplicative 1-2-3 Conjecture
Julien Bensmail, Hervé Hocquard, Dimitri Lajou +1
The product version of the 1-2-3 Conjecture, introduced by Skowronek-Kazi{ó}w in 2012, states that, a few obvious exceptions apart, all graphs can be 3-edge-labelled so that no two…
Pushable chromatic number of graphs with degree constraints
Julien Bensmail, Sandip Das, Soumen Nandi +4
Pushable homomorphisms and the pushable chromatic number of oriented graphs were introduced by Klostermeyer and MacGillivray in 2004. They notably observed that, for any orie…