The following pages link to On the width—length inequality (Q3851959):
Displaying 50 items.
- An extension of Lehman's theorem and ideal set functions (Q298985) (← links)
- Fractional packing in ideal clutters (Q431029) (← links)
- On circulant thin Lehman matrices (Q484160) (← links)
- On the behavior of the \(N_{+}\)-operator under blocker duality (Q628328) (← links)
- Lehman's forbidden minor characterization of ideal 0-1 matrices (Q686505) (← links)
- Ideal clutters (Q697573) (← links)
- Vertex adjacencies in the set covering polyhedron (Q730484) (← links)
- Thin Lehman matrices arising from finite groups (Q763068) (← links)
- The Klein bottle and multicommodity flows (Q920100) (← links)
- A unified interpretation of several combinatorial dualities (Q951109) (← links)
- Circuit and fractional circuit covers of matroids (Q976155) (← links)
- The nonidealness index of rank-ideal matrices (Q987680) (← links)
- On packing and covering polyhedra of consecutive ones circulant clutters (Q987683) (← links)
- On the set covering polyhedron of circulant matrices (Q1015320) (← links)
- Families of cuts with the MFMC-property (Q1082240) (← links)
- Polyhedra of regular p-nary group problems (Q1121172) (← links)
- An analytical comparison of different formulations of the travelling salesman problem (Q1181739) (← links)
- The matroids with the max-flow min-cut property (Q1245970) (← links)
- A catalog of minimally nonideal matrices (Q1298742) (← links)
- An analytic symmetrization of max flow-min cut (Q1356775) (← links)
- \((0,\pm 1)\) ideal matrices (Q1380940) (← links)
- On the cut polyhedron. (Q1426123) (← links)
- Non-regular square bipartite designs (Q1601620) (← links)
- On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
- Progress on the description of identifying code polyhedra for some families of split graphs (Q1751187) (← links)
- Clutters with \(\tau_ 2 \Relbar 2\tau\) (Q1801694) (← links)
- Graph imperfection. I (Q1850556) (← links)
- A characterization of weakly bipartite graphs (Q1850558) (← links)
- Applying Lehman's theorems to packing problems (Q1919808) (← links)
- Cuboids, a class of clutters (Q1985449) (← links)
- A new infinite class of ideal minimally non-packing clutters (Q2032738) (← links)
- The star dichromatic number (Q2062686) (← links)
- Intersecting and dense restrictions of clutters in polynomial time (Q2164697) (← links)
- Structure of cubic Lehman matrices (Q2325755) (← links)
- Deltas, extended odd holes and their blockers (Q2421555) (← links)
- Some insight into characterizations of minimally nonideal matrices (Q2483016) (← links)
- On a certain class of nonideal clutters (Q2500534) (← links)
- Note on: N. E. Aguilera, M. S. Escalante, G. L. Nasini, ``The disjunctive procedure and blocker duality'' (Q2565860) (← links)
- Intersecting restrictions in clutters (Q2658378) (← links)
- A sharp bound on the size of a connected matroid (Q2723463) (← links)
- (Q2857444) (← links)
- Delta Minors, Delta Free Clutters, and Entanglement (Q3177442) (← links)
- Lehman's Theorem and the Directed Steiner Tree Problem (Q3462549) (← links)
- Arithmetic relations in the set covering polyhedron of circulant clutters (Q3503540) (← links)
- The nonidealness index of circulant matrices (Q3503550) (← links)
- Binary group and Chinese postman polyhedra (Q3717740) (← links)
- Extremal Length and Width of Blocking Polyhedra, Kirchhoff Spaces and Multiport Networks (Q3795495) (← links)
- Quasi-balanced matrices (Q4060720) (← links)
- On Four Problems in Graph Theory (Q4722099) (← links)
- Packing rooted directed cuts in a weighted directed graph (Q4769069) (← links)
