Brahim Chaourar

activity

20162025

collaborators

Showing 2019Show all

3 papers · 1 filter

cs.DS2019

Connected max cut is polynomial for graphs without $K_{5} \ e$ as a minor

Brahim Chaourar

Given a graph $G = (V, E)$ , a connected cut $δ (U)$ is the set of edges of E linking all vertices of U to all vertices of $V \ U$ such that the induced subgraphs $G [U]$ and $G…

math.CO2019

The facets of the spanning trees polytope

Brahim Chaourar

Let $G = (V, E)$ be an undirected graph. The spanning trees polytope $P (G)$ is the convex hull of the characteristic vectors of all spanning trees of $G$ . In this paper, we describe…

math.OC2019

The Facets of the Subtours Elimination Polytope

Brahim Chaourar

Let $G = (V, E)$ be an undirected graph. The subtours elimination polytope $P (G)$ is the set of $x \in R^{E}$ such that: $0 \leq x (e) \leq 1$ for any edge $e \in E$ , $x (δ (v)) = 2$ f…

Connected max cut is polynomial for graphs without K5​\e as a minor

The facets of the spanning trees polytope

The Facets of the Subtours Elimination Polytope

Connected max cut is polynomial for graphs without $K_{5} \ e$ as a minor