The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are W-perfect

DOI10.1016/J.JCTB.2014.02.006MaRDI QIDQ403365zbMATH OpenOpenAlexFDO

Authors A. Galluccio, Claudio Gentile, P. Ventura

Publication date 29 August 2014

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jctb.2014.02.006

zbMATH Keywords

claw-free graphspolyhedral combinatoricsstable set polytope

Mathematics Subject Classification ID

Paths and cycles (05C38) Fractional graph theory, fuzzy graph theory (05C72) Graph operations (line graphs, products, etc.) (05C76) Polytopes and polyhedra (52B99)

Recommendations

• The stable set polytope of claw-free graphs with large stability number
• On the Stable Set Polytope of Claw-Free Graphs
• The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect
• Clique-circulants and the stable set polytope of fuzzy circular interval graphs
• The stable set polytope of quasi-line graphs

Cites work

• 2-clique-bond of stable set polyhedra
• A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
• Blocking and anti-blocking pairs of polyhedra
• Bull-free Berge graphs are perfect
• Claw-free graphs. IV: Decomposition theorem
• Claw-free graphs. V. Global structure
• Clique family inequalities for the stable set polytope of quasi-line graphs.
• Gear composition and the stable set polytope
• Gear composition of stable set polytopes and G-perfection
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 3862930 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Maximum matching and a polyhedron with 0,1-vertices
• Near-perfect matrices
• On certain polytopes associated with graphs
• On facets of stable set polytopes of claw-free graphs with stability number three
• On maximal independent sets of vertices in claw-free graphs
• On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
• On stable set polyhedra for K//(1,3)free graphs
• On the facial structure of set packing polyhedra
• On the stable set polytope of a series-parallel graph
• Properties of vertex packing and independence system polyhedra
• The ellipsoid method and its consequences in combinatorial optimization
• The rank facets of the stable set polytope for claw-free graphs
• The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect
• The stable set polytope of quasi-line graphs
• The structure of claw-free graphs

Cited in

(10)

• Separation routine and extended formulations for the stable set problem in claw-free graphs
• Strengthened clique-family inequalities for the stable set polytope
• 2-clique-bond of stable set polyhedra
• On the facets of stable set polytopes of circular interval graphs
• Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs
• Lovász-Schrijver PSD-operator on claw-free graphs
• On the Stable Set Polytope of Claw-Free Graphs
• The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect
• The stable set polytope of icosahedral graphs
• On facets of stable set polytopes of claw-free graphs with stability number 3

This page was built for publication: The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403365)