2 citations · 2 across the 4 of their papers we have counts for
5 papers · 1 filter
Irreducible pairings and indecomposable tournaments
Houmem Belkhechine, Cherifa Ben Salha, Rim Romdhane
We only consider finite structures. With every totally ordered set and a subset of , we associate the underlying tournament obta…
Making a tournament indecomposable by one subtournament-reversal operation
Houmem Belkhechine, Cherifa Ben Salha
Given a tournament , a module of is a subset of such that for and , if and only if . The trivial…
Partially critical 2-structures
Houmem Belkhechine, Imed Boudabbous, Pierre Ille
A 2-structure consists of a vertex set and of an equivalence relation defined on . Given a 2-structure , a s…
Primarily orientable graphs
Houmem Belkhechine
A graph is primarily orientable if it is possible to orient its edges in such a way that the resulting oriented graph is prime, i.e., indecomposable under modular decomposition…
Decomposability and co-modular indices of tournaments
Houmem Belkhechine, Cherifa Ben Salha
Given a tournament , a module of is a subset of such that for and , if and only if . The trivial…