Pages that link to "Item:Q5668263"
From MaRDI portal
The following pages link to Blocking and anti-blocking pairs of polyhedra (Q5668263):
Displayed 50 items.
- Path-closed sets (Q802569) (← links)
- Entropy splitting for antiblocking corners and perfect graphs (Q810528) (← links)
- Fano colourings of cubic graphs and the Fulkerson conjecture (Q817779) (← links)
- Entropy of symmetric graphs (Q898092) (← links)
- The complexity of recognizing linear systems with certain integrality properties (Q927158) (← links)
- Polarity and the complexity of the shooting experiment (Q951126) (← links)
- Perfect matchings with restricted intersection in cubic graphs (Q976153) (← links)
- Families of dot-product snarks on orientable surfaces of low genus (Q995768) (← links)
- A note on Berge-Fulkerson coloring (Q1043939) (← links)
- On a geometric property of perfect graphs (Q1053035) (← links)
- Testing membership in matroid polyhedra (Q1056350) (← links)
- A new proof of a theorem of Harper on the Sperner-Erdős problem (Q1065006) (← links)
- Relaxations of vertex packing (Q1078206) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs (Q1096639) (← links)
- Edge-packings of graphs and network reliability (Q1111461) (← links)
- A generalization of Robacker's theorem (Q1118612) (← links)
- On the facial structure of the set covering polytope (Q1122481) (← links)
- On the spanning tree polyhedron (Q1122482) (← links)
- Perfect graphs are kernel solvable (Q1126176) (← links)
- Graphical properties related to minimal imperfection (Q1132889) (← links)
- Discrete extremal problems (Q1152306) (← links)
- Perfect graphs and norms (Q1177234) (← links)
- Integer flows and cycle covers (Q1186130) (← links)
- Separating from the dominant of the spanning tree polytope (Q1200792) (← links)
- A class of facet producing graphs for vertex packing polyhedra (Q1220520) (← links)
- A proof of Fulkerson's characterization of permutation matrices (Q1221117) (← links)
- Blocking pairs of polyhedra arising from network flows (Q1221561) (← links)
- Almost integral polyhedra related to certain combinatorial optimization problems (Q1240148) (← links)
- An unbounded matroid intersection polyhedron (Q1244236) (← links)
- Classification de certaines matrices 0-1 (Q1245835) (← 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)
- Lower bounds on the cover-index of a graph (Q1255966) (← links)
- An abstract duality (Q1262319) (← links)
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets (Q1330902) (← links)
- Extremal problems for finite sets and convex hulls---a survey (Q1356702) (← links)
- On certain polytopes associated with graphs (Q1393418) (← links)
- Graph covers using \(t\)-colourable vertex sets. (Q1427470) (← links)
- Cores, joins and the Fano-flow conjectures (Q1692639) (← links)
- Perfect matching covers of cubic graphs of oddness 2 (Q1732040) (← links)
- Berge-Fulkerson coloring for infinite families of snarks (Q1734033) (← links)
- On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
- Polyhedral results on the stable set problem in graphs containing even or odd pairs (Q1785209) (← links)
- On a connection between facility location and perfect graphs (Q1785286) (← links)
- On packing and covering polyhedra in infinite dimensions (Q1785750) (← links)
- Clutters with \(\tau_ 2 \Relbar 2\tau\) (Q1801694) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- On totally dual integral systems (Q1824553) (← links)