15 citations · 18 across the 4 of their papers we have counts for
4 papers
Indecomposable tournaments and their indecomposable subtournaments on 5 and 7 vertices
Houmem BELKHECHINE, Imed BOUDABBOUS
Given a tournament T=(V,A), a subset X of is an interval of T provided that for every a, b in X and x\in V-X, (a,x) in A if and only if (b,x) in A. For example, , {x…
Les tournois (-1)-critiques
Houmem Belkhechine, Imed Boudabbous, Jamel Dammak
Given a tournament T=(V,A), a subset X of V is an interval of T provided that for any a, b\in X and x\in V-X, (a,x) \in A if and only if (b,x)\in A. For example, \emptyset, \{x\} (…
Les graphes (-1)-critiques
Houmem Belkhechine, Imed Boudabbous, Mohamed Baka Elayech
Given a (directed) graph G=(V,A), a subset X of V is an interval of G provided that for any a, b\in X and x\in V-X, (a,x)\in A if and only if (b,x)\in A and (x,a)\in A if and only…
Inversion dans les tournois
Houmem Belkhechine, Moncef Bouaziz, Imed Boudabbous +1
We consider the transformation reversing all arcs of a subset of the vertex set of a tournament . The \emph{index} of , denoted by , is the smallest number of subse…