Selma Djelloul

According to our database, Selma Djelloul authored at least 9 papers between 1994 and 2018.

Collaborative distances:

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

2018

Edge k-q-Colorability of Graphs.

Selma Djelloul, Odile Favaron, Mekkia Kouider

J. Graph Algorithms Appl., 2018

2014

Solving Matching Problems Efficiently in Bipartite Graphs.

Selma Djelloul

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2009

Treewidth and logical definability of graph products.

Selma Djelloul

Theor. Comput. Sci., 2009

2005

Graph decompositions for cartesian products.

Selma Djelloul

Electron. Notes Discret. Math., 2005

2003

Minimum survivable graphs with bounded distance increase.

Selma Djelloul, Mekkia Kouider

Discret. Math. Theor. Comput. Sci., 2003

2001

On weighted mean distance.

Selma Djelloul, Mekkia Kouider

Australas. J Comb., 2001

1995

Edge Deletion Preserving the Diameter of the Hypercube.

Abdelmadjid Bouabdallah, Charles Delorme, Selma Djelloul

Discret. Appl. Math., 1995

1994

Broadcasting in m-dimensional grid graphs with a given neighborhood template.

Selma Djelloul

Discret. Appl. Math., 1994

Dense bus networks of diameter 2.

Jean-Claude Bermond, Johny Bond, Selma Djelloul

Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994