The following pages link to Anti-blocking polyhedra (Q2549326):
Displaying 50 items.
- On claw-free \(t\)-perfect graphs (Q431021) (← links)
- Combinatorial characterization of read-once formulae (Q685684) (← links)
- Some remarks on Hajós' conjecture (Q707025) (← links)
- A min-max relation for the partial q-colourings of a graph. II: Box perfection (Q752726) (← links)
- On the integrality of an extreme solution to pluperfect graph and balanced systems (Q800230) (← links)
- Path-closed sets (Q802569) (← links)
- Minmax relations for cyclically ordered digraphs (Q885290) (← links)
- Blocking versus nonblocking interprocess communication: A note on the effect on concurrency (Q917284) (← links)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- Independence-domination duality (Q958688) (← links)
- A note on kernels and Sperner's Lemma (Q967389) (← links)
- A polyhedral approach to the stability of a family of coalitions (Q968155) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- On a geometric property of perfect graphs (Q1053035) (← links)
- Some sequences associated with combinatorial structures (Q1073032) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- Some properties of minimal imperfect graphs (Q1126292) (← links)
- Graphical properties related to minimal imperfection (Q1132889) (← links)
- Zur Theorie der perfekten Graphen (Q1134773) (← links)
- Discrete extremal problems (Q1152306) (← links)
- On stable set polyhedra for K//(1,3)free graphs (Q1168982) (← links)
- Coflow polyhedra (Q1197009) (← links)
- A class of facet producing graphs for vertex packing polyhedra (Q1220520) (← links)
- Blocking pairs of polyhedra arising from network flows (Q1221561) (← links)
- Some partitions associated with a partially ordered set (Q1224110) (← links)
- On formal fractions associated with the symmetric groups (Q1229247) (← links)
- Almost integral polyhedra related to certain combinatorial optimization problems (Q1240148) (← links)
- Critical perfect graphs and perfect 3-chromatic graphs (Q1245851) (← links)
- The matroids with the max-flow min-cut property (Q1245970) (← links)
- Blocking, antiblocking, and pairs of matroids and polymatroids (Q1255012) (← links)
- Fractionally colouring total graphs (Q1316649) (← links)
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (Q1339397) (← links)
- Extremal problems for finite sets and convex hulls---a survey (Q1356702) (← links)
- On perfect \(0,\pm 1\) matrices (Q1356731) (← links)
- Fractional and integral colourings (Q1363414) (← links)
- On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
- On packing and covering polyhedra in infinite dimensions (Q1785750) (← links)
- On totally dual integral systems (Q1824553) (← links)
- The facets and the symmetries of the approval-voting polytope (Q1880786) (← links)
- Lift-and-project ranks and antiblocker duality (Q1886795) (← links)
- Cardinality-restricted chains and antichains in partially ordered sets (Q1917285) (← links)
- Strong IP formulations need large coefficients (Q2019425) (← links)
- The \(h^\ast\)-polynomials of locally anti-blocking lattice polytopes and their \(\gamma\)-positivity (Q2046447) (← links)
- Combinatorial differential algebra of \(x^p\) (Q2156366) (← links)
- Unconditional reflexive polytopes (Q2197693) (← links)
- On circular-perfect graphs: a survey (Q2225429) (← links)
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs (Q2364493) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- Alternatives for testing total dual integrality (Q2429472) (← links)
- Perfect graphs, kernels, and cores of cooperative games (Q2433701) (← links)
