scientific article
From MaRDI portal
Publication:2861525
zbMath1274.90454MaRDI QIDQ2861525
Claudio Gentile, Anna Galluccio, Paolo Ventura
Publication date: 8 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001319
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
On the facets of the stable set polytope of quasi-line graphs ⋮ Domination When the Stars Are Out ⋮ Extended formulations, nonnegative factorizations, and randomized communication protocols
Cites Work
- Unnamed Item
- Unnamed Item
- The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect
- Claw-free graphs. IV: Decomposition theorem
- The stable set polytope of quasi-line graphs
- Gear composition and the stable set polytope
- On maximal independent sets of vertices in claw-free graphs
- The ellipsoid method and its consequences in combinatorial optimization
- On stable set polyhedra for K//(1,3)free graphs
- The rank facets of the stable set polytope for claw-free graphs
- On certain polytopes associated with graphs
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
- Compositions for perfect graphs
- 2-clique-bond of stable set polyhedra
- Gear Composition of Stable Set Polytopes and 𝒢-Perfection
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
- Compositions of Graphs and Polyhedra II: Stable Sets
- On the facial structure of set packing polyhedra
- Maximum matching and a polyhedron with 0,1-vertices
This page was built for publication:
