The following pages link to (Q4234148):
Displayed 15 items.
- 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)
- Some classical combinatorial problems on circulant and claw-free graphs: The isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs (Q1041408) (← links)
- Hamiltonicity in claw-free graphs (Q1186134) (← links)
- Clique family inequalities for the stable set polytope of quasi-line graphs. (Q1414593) (← links)
- Applying Lehman's theorems to packing problems (Q1919808) (← links)
- A reduction algorithm for the weighted stable set problem in claw-free graphs (Q2448908) (← links)
- (Q2861525) (← links)
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs (Q3503841) (← links)
- On the Stable Set Polytope of Claw-Free Graphs (Q5505672) (← links)
- (Q5708520) (← links)
- Extended formulations in combinatorial optimization (Q5900907) (← links)
- Extended formulations in combinatorial optimization (Q5919994) (← links)
- Discrete relaxations of combinatorial programs (Q5946814) (← links)