The following pages link to (Q4871778):
Displaying 7 items.
- The stable set polytope for some extensions of \(P_4\)-free graphs (Q998505) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- A short proof of a theorem of Falmagne. (Q1431817) (← links)
- Counting stable sets on Cartesian products of graphs (Q1584266) (← links)
- The facets and the symmetries of the approval-voting polytope (Q1880786) (← links)
- An optimal bound to access the core in TU-games (Q2435888) (← links)
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079) (← links)
