Pages that link to "Item:Q1168982"
From MaRDI portal
The following pages link to On stable set polyhedra for K//(1,3)free graphs (Q1168982):
Displayed 18 items.
- A construction for non-rank facets of stable set polytopes of webs (Q852709) (← links)
- Clique-circulants and the stable set polytope of fuzzy circular interval graphs (Q948961) (← links)
- The stable set polytope of quasi-line graphs (Q949780) (← links)
- Gear composition and the stable set polytope (Q1003487) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- The maximum clique problem (Q1318271) (← links)
- Vertex packing problem application to the design of electronic testing fixtures (Q1339134) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- An approach to solving \(A^{k}=J-I\) (Q1414133) (← links)
- Clique family inequalities for the stable set polytope of quasi-line graphs. (Q1414593) (← links)
- Applying Lehman's theorems to packing problems (Q1919808) (← links)
- On non-rank facets of stable set polytopes of webs with clique number four (Q2492218) (← links)
- Almost all webs are not rank-perfect (Q2583128) (← links)
- Generalized clique family inequalities for claw-free graphs (Q3439487) (← links)
- On facets of stable set polytopes of claw-free graphs with stability number three (Q3439583) (← links)
- On the Stable Set Polytope of Claw-Free Graphs (Q5505672) (← links)
- (Q5708520) (← links)
- (Q5708546) (← links)