On the Stable Set Polytope of Claw-Free Graphs
From MaRDI portal
Publication:5505672
DOI10.1007/978-3-540-85097-7_32zbMath1168.90584OpenAlexW1519980742MaRDI QIDQ5505672
Claudio Gentile, Anna Galluccio, Paolo Ventura
Publication date: 27 January 2009
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_32
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Cites Work
- Unnamed Item
- Claw-free graphs. IV: Decomposition theorem
- The stable set polytope of quasi-line graphs
- Gear composition and the stable set polytope
- On the stable set polytope of a series-parallel graph
- On maximal independent sets of vertices in claw-free graphs
- On stable set polyhedra for K//(1,3)free graphs
- Geometric algorithms and combinatorial optimization
- The rank facets of the stable set polytope for claw-free graphs
- On the cut polyhedron.
- On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
- Claw-free graphs. VII. Quasi-line graphs
- Gear Composition of Stable Set Polytopes and 𝒢-Perfection
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
- On the facial structure of set packing polyhedra
- Maximum matching and a polyhedron with 0,1-vertices