20 citations · 22 across the 6 of their papers we have counts for
6 papers · 1 filter
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…
Distinguishing numbers and distinguishing indices of oriented graphs
Kahina Meslem, Eric Sopena
A distinguishing r-vertex-labelling (resp. r-edge-labelling) of an undirected graph G is a mapping from the set of vertices (resp. the set of edges) of G to the set of labels {…
A note on the neighbour-distinguishing index of digraphs
Eric Sopena, Mariusz Woźniak
In this note, we introduce and study a new version of neighbour-distinguishing arc-colourings of digraphs. An arc-colouring of a digraph is proper if no two arcs with the s…
A Connected Version of the Graph Coloring Game
Eric Sopena, Clément Charpentier, Hervé Hocquard +1
The graph coloring game is a two-player game in which, given a graph G and a set of k colors, the two players, Alice and Bob, take turns coloring properly an uncolored vertex of G,…
Broadcasts on Paths and Cycles
Sabrina Bouchouika, Isma Bouchemakh, Eric Sopena
A broadcast on a graph is a function such that for every vertex , where$\operatorname…
On the Broadcast Independence Number of Locally Uniform 2-Lobsters
Messaouda Ahmane, Isma Bouchemakh, Eric Sopena
Let be a simple undirected graph.A broadcast on isa function such that holds for every vertex of , where denotes…