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.006zbMATH Open1297.05196OpenAlexW2133251874MaRDI QIDQ403365FDOQ403365

A. Galluccio, P. Ventura, Claudio Gentile

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

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

zbMATH Keywords

polyhedral combinatoricsclaw-free graphsstable set polytope

Mathematics Subject Classification ID

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

Cites Work

• Geometric algorithms and combinatorial optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Properties of vertex packing and independence system polyhedra
• The ellipsoid method and its consequences in combinatorial optimization
• On certain polytopes associated with graphs
• On the facial structure of set packing polyhedra
• Maximum matching and a polyhedron with 0,1-vertices
• Claw-free graphs. V. Global structure
• The structure of claw-free graphs
• On maximal independent sets of vertices in claw-free graphs
• Blocking and anti-blocking pairs of polyhedra
• On stable set polyhedra for K//(1,3)free graphs
• The rank facets of the stable set polytope for claw-free 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
• The stable set polytope of quasi-line graphs
• A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
• Claw-free graphs. IV: Decomposition theorem
• Gear composition and the stable set polytope
• Bull-free Berge graphs are perfect
• On the stable set polytope of a series-parallel graph
• Near-perfect matrices
• 2-clique-bond of stable set polyhedra
• Gear Composition of Stable Set Polytopes and 𝒢-Perfection
• On facets of stable set polytopes of claw-free graphs with stability number three
• The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect

Cited In (9)

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

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)