Amel Harkat-Benhamdine

According to our database, Amel Harkat-Benhamdine authored at least 6 papers between 1997 and 2001.

Collaborative distances:

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

2001

Partitioning vertices of 1-tough graphs into paths.

Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak

Theor. Comput. Sci., 2001

A note on the vertex-distinguishing proper coloring of graphs with large minimum degree.

Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak

Discret. Math., 2001

2000

Cyclability of 3-connected graphs.

Amel Harkat-Benhamdine, Hao Li, Feng Tian

J. Graph Theory, 2000

1999

On the Vertex-Distinguishing Proper Edge-Colorings of Graphs.

Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak

J. Comb. Theory, Ser. B, 1999

Distance-Dominating Cycles in Quasi Claw-Free Graphs.

Chuanping Chen, Amel Harkat-Benhamdine, Hao Li

Graphs Comb., 1999

1997

Dlambda-cycles in lambda-claw-free graphs.

Mohamed El Kadi Abderrezzak, Evelyne Flandrin, Amel Harkat-Benhamdine, Hao Li

Discret. Math., 1997