Pages that link to "Item:Q5668263"
From MaRDI portal
The following pages link to Blocking and anti-blocking pairs of polyhedra (Q5668263):
Displaying 50 items.
- On snarks that are far from being 3-edge colorable (Q281587) (← links)
- The cost of perfection for matchings in graphs (Q299061) (← links)
- On excessive index of certain networks (Q391312) (← links)
- Covering a cubic graph with perfect matchings (Q393450) (← links)
- On CIS circulants (Q394314) (← links)
- Sparsely intersecting perfect matchings in cubic graphs (Q397063) (← links)
- The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect (Q403365) (← links)
- On claw-free \(t\)-perfect graphs (Q431021) (← links)
- Fractional packing in ideal clutters (Q431029) (← links)
- Unique Fulkerson coloring of Petersen minor-free cubic graphs (Q458594) (← links)
- Generation and properties of snarks (Q463288) (← links)
- On circulant thin Lehman matrices (Q484160) (← links)
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- Two easy duality theorems for product partial orders (Q580378) (← links)
- Strong formulation for the spot 5 daily photograph scheduling problem (Q613663) (← links)
- Graphs of arbitrary excessive class (Q616357) (← links)
- A set partitioning reformulation of a school bus scheduling problem (Q657252) (← links)
- Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
- Signed cycle double covers (Q668036) (← links)
- Lehman's forbidden minor characterization of ideal 0-1 matrices (Q686505) (← links)
- The anti-join composition and polyhedra (Q688264) (← links)
- On cuts and matchings in planar graphs (Q688915) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Treelike snarks (Q727053) (← links)
- Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture (Q740648) (← links)
- On the excessive \([m]\)-index of a tree (Q741745) (← links)
- A min-max relation for the partial q-colourings of a graph. II: Box perfection (Q752726) (← links)
- Total weak unimodularity: Testing and applications (Q798401) (← links)
- A class of h-perfect graphs (Q799701) (← links)
- On the integrality of an extreme solution to pluperfect graph and balanced systems (Q800230) (← links)
- On some weakly bipartite graphs (Q800231) (← links)
- 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)
