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

Description of the Tournaments Which are Reconstructible from Their k-cycle Partial Digraphs for k ∈ {3, 4}. - Rim Ben Hamadou; Youssef Boudabbous; Nadia El Amri; Gérard Lopez (Graphs Comb., 2016)

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