Pages that link to "Item:Q1147168"
From MaRDI portal
The following pages link to Polytope des independants d'un graphe série-parallèle (Q1147168):
Displaying 25 items.
- On claw-free \(t\)-perfect graphs (Q431021) (← links)
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\) (Q582302) (← links)
- A class of h-perfect graphs (Q799701) (← links)
- \(K_ i\)-covers. I: Complexity and polytopes (Q1070249) (← links)
- Relaxations of vertex packing (Q1078206) (← links)
- A solvable case of quadratic 0-1 programming (Q1079494) (← links)
- Matrices with the Edmonds-Johnson property (Q1100483) (← links)
- On the stable set polytope of a series-parallel graph (Q1106858) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- Facets of the balanced (acyclic) induced subgraph polytope (Q1122491) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- A solvable class of quadratic 0-1 programming (Q1193723) (← links)
- The maximum clique problem (Q1318271) (← links)
- The Steiner tree polytope and related polyhedra (Q1322552) (← links)
- Arborescence polytopes for series-parallel graphs (Q1329787) (← links)
- Fractional and integral colourings (Q1363414) (← links)
- Extended formulations for vertex cover (Q1790198) (← links)
- Graph imperfection. I (Q1850556) (← links)
- Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs (Q2463465) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770) (← links)
- Complementation in T-perfect graphs (Q2672429) (← links)
- Claw-free \(t\)-perfect graphs can be recognized in polynomial time (Q2804992) (← links)
- Characterising claw-free \(t\)-perfect graphs (Q2851509) (← links)
- $t$-Perfection in $P_5$-Free Graphs (Q5348215) (← links)
- Combining decomposition approaches for the maximum weight stable set problem (Q6040632) (← links)
