Imed Boudabbous

activity

20102021

most citedIndecomposable tournaments and their indecomposable subtournaments on 5 and 7 vertices

3 citations · 5 across the 4 of their papers we have counts for

collaborators

Showing 2013Show all

2 papers · 1 filter

math.CO2013

Graphs whose indecomposability graph is 2-covered

Rim Ben Hamadou, Imed Boudabbous

Given a graph $G = (V, E)$ , 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 E$ if and only if ${b, x} \in E$ . For ex…

math.CO2013

The indecomposable tournaments $T$ with $∣ W_{5} (T) ∣=∣ T ∣ - 2$

Houmem Belkhechine, Imed Boudabbous, Kaouthar Hzami

We consider a tournament $T = (V, A)$ . For $X \subseteq V$ , the subtournament of $T$ induced by $X$ is $T [X] = (X, A \cap (X \times X))$ . An interval of $T$ is a subset $X$ of $V$ suc…

Graphs whose indecomposability graph is 2-covered

The indecomposable tournaments T with ∣W5​(T)∣=∣T∣−2

The indecomposable tournaments $T$ with $∣ W_{5} (T) ∣=∣ T ∣ - 2$