On stable set polyhedra for K//(1,3)free graphs
From MaRDI portal
(Redirected from Publication:1168982)
Cites work
- scientific article; zbMATH DE number 3884202 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3763984 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- scientific article; zbMATH DE number 3420800 (Why is no real title available?)
- A characterization of perfect graphs
- A class of facet producing graphs for vertex packing polyhedra
- Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs
- Almost integral polyhedra related to certain combinatorial optimization problems
- Anti-blocking polyhedra
- Coloring a Family of Circular Arcs
- Critical perfect graphs and perfect 3-chromatic graphs
- Edmonds polytopes and a hierarchy of combinatorial problems
- Graphical properties related to minimal imperfection
- Maximum matching and a polyhedron with 0,1-vertices
- Normal hypergraphs and the perfect graph conjecture
- On maximal independent sets of vertices in claw-free graphs
- On the facial structure of set packing polyhedra
- On the strong perfect graph conjecture
- Perfect zero–one matrices
- Properties of vertex packing and independence system polyhedra
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
Cited in
(37)- Almost all webs are not rank-perfect
- The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect
- The maximum clique problem
- Strengthened clique-family inequalities for the stable set polytope
- 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
- An approach to solving \(A^{k}=J-I\)
- Gear composition and the stable set polytope
- The stable set polytope of claw-free graphs with large stability number
- Extended formulations in combinatorial optimization
- Lovász-Schrijver PSD-operator on claw-free graphs
- On cutting-plane proofs in combinatorial optimization
- Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope
- Claw-free graphs---a survey
- Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs
- On the mixed set covering, packing and partitioning polytope
- The stable set polytope of quasi-line graphs
- scientific article; zbMATH DE number 2230228 (Why is no real title available?)
- scientific article; zbMATH DE number 2230253 (Why is no real title available?)
- A construction for non-rank facets of stable set polytopes of webs
- Extended formulations in combinatorial optimization
- Clique-circulants and the stable set polytope of fuzzy circular interval graphs
- 2-clique-bond of stable set polyhedra
- The stable set polytope of icosahedral graphs
- Total coloring of quasi-line graphs and inflated graphs
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- A note on the Chvàtal-Rank of clique family inequalities
- On non-rank facets of stable set polytopes of webs with clique number four
- On the facets of the stable set polytope of quasi-line graphs
- Applying Lehman's theorems to packing problems
- Vertex packing problem application to the design of electronic testing fixtures
- On facets of stable set polytopes of claw-free graphs with stability number three
- On the Stable Set Polytope of Claw-Free Graphs
- Small Chvátal rank
- On the complete set packing and set partitioning polytopes: properties and rank 1 facets
- On the facets of stable set polytopes of circular interval graphs
- Generalized clique family inequalities for claw-free graphs
This page was built for publication: On stable set polyhedra for K//(1,3)free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1168982)
