Souad Slimani

According to our database, Souad Slimani authored at least 6 papers between 2013 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2020

Optimal Adjacent Vertex-Distinguishing Edge-Colorings of Circulant Graphs.

Sylvain Gravier, Hippolyte Signargout, Souad Slimani

CoRR, 2020

2018

Game distinguishing numbers of Cartesian products.

Sylvain Gravier, Kahina Meslem, Simon Schmidt, Souad Slimani

Ars Math. Contemp., 2018

2017

A New Game Invariant of Graphs: the Game Distinguishing Number.

Sylvain Gravier, Kahina Meslem, Simon Schmidt, Souad Slimani

Discret. Math. Theor. Comput. Sci., 2017

2016

Relaxed Locally Identifying Coloring of Graphs.

Méziane Aïder, Sylvain Gravier, Souad Slimani

Graphs Comb., 2016

2015

Distinguishing Number and Circulant Graphs.

Kahina Meslem, Sylvain Gravier, Souad Slimani

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2013

(<i>a</i>, <i>b</i>)-codes in <i>Z</i>/<i>n</i><i>Z</i>.

Sylvain Gravier, Anne Lacroix, Souad Slimani

Discret. Appl. Math., 2013