Pages that link to "Item:Q1785209"

The following pages link to Polyhedral results on the stable set problem in graphs containing even or odd pairs (Q1785209):

Displaying 8 items.

• Extension complexity of stable set polytopes of bipartite graphs (Q1687905) (← links)
• The strength of Dantzig-Wolfe reformulations for the stable set and related problems (Q1756353) (← links)
• Even cycles and perfect matching problems with side constraints (Q1888173) (← links)
• Even pairs in Artemis graphs (Q1978154) (← links)
• The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
• THE GENERALIZED STABLE SET PROBLEM FOR PERFECT BIDIRECTED GRAPHS (Q4366150) (← links)
• Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles (Q5041738) (← links)
• Stable 2-pairs and \((X,Y)\)-intersection graphs (Q5931414) (← links)