Imed Boudabbous

According to our database, Imed Boudabbous authored at least 9 papers between 2007 and 2022.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of four.

2022

Minimal Duo-free Digraphs for One or Two Vertices.

Nesrine Azizi, Imed Boudabbous, Abdeljelil Salhi

J. Multiple Valued Log. Soft Comput., 2022

2020

Description of the Triangle-free Prime Graphs Having at Most Two Non Critical Vertices.

Imed Boudabbous, Walid Marweni

J. Multiple Valued Log. Soft Comput., 2020

2018

Recognizing Indecomposability for Tournaments.

Rim Ben Hamadou, Imed Boudabbous, Nadia El Amri

J. Multiple Valued Log. Soft Comput., 2018

2016

Tournaments whose indecomposability graph admits a vertex cover of size 2.

Imed Boudabbous

Ars Comb., 2016

2015

Graphs Whose Indecomposability Graph is 2-Covered.

Rim Ben Hamadou, Imed Boudabbous

J. Multiple Valued Log. Soft Comput., 2015

Les graphes (-1)-critiques.

Houmem Belkhechine, Imed Boudabbous, Mohamed Baka Elayech

Ars Comb., 2015

2013

Indecomposable tournaments and their indecomposable subtournaments on 5 and 7 vertices.

Houmem Belkhechine, Imed Boudabbous

Ars Comb., 2013

2011

Ultracritical and hypercritical binary structures.

Imed Boudabbous, Pierre Ille

Discret. Math., 2011

2007

Critical and infinite directed graphs.

Imed Boudabbous, Pierre Ille

Discret. Math., 2007