Critical and infinite directed graphs. - Imed Boudabbous; Pierre Ille (Discret. Math., 2007)

Ultracritical and hypercritical binary structures. - Imed Boudabbous; Pierre Ille (Discret. Math., 2011)

Indecomposable tournaments and their indecomposable subtournaments on 5 and 7 vertices. - Houmem Belkhechine; Imed Boudabbous (Ars Comb., 2013)

Les graphes (-1)-critiques. - Houmem Belkhechine; Imed Boudabbous; Mohamed Baka Elayech (Ars Comb., 2015)

Graphs Whose Indecomposability Graph is 2-Covered. - Rim Ben Hamadou; Imed Boudabbous (J. Multiple Valued Log. Soft Comput., 2015)

Tournaments whose indecomposability graph admits a vertex cover of size 2. - Imed Boudabbous (Ars Comb., 2016)

Recognizing Indecomposability for Tournaments. - Rim Ben Hamadou; Imed Boudabbous; Nadia El Amri (J. Multiple Valued Log. Soft Comput., 2018)

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)

Minimal Duo-free Digraphs for One or Two Vertices. - Nesrine Azizi; Imed Boudabbous; Abdeljelil Salhi (J. Multiple Valued Log. Soft Comput., 2022)