The following pages link to Guenin, Bertrand (Q163020):
Displayed 45 items.
- (Q234316) (redirect page) (← links)
- Stabilizer theorems for even cycle matroids (Q256984) (← links)
- A survey on flows in graphs and matroids (Q298967) (← links)
- (Q499454) (redirect page) (← links)
- Displaying blocking pairs in signed graphs (Q499457) (← links)
- Packing directed circuits exactly (Q663091) (← links)
- Ideal clutters (Q697573) (← links)
- A family of switch equivalent graphs (Q704278) (← links)
- Lehman matrices (Q1025999) (← links)
- A short proof of Seymour's characterization of the matroids with the max-flow min-cut property (Q1403921) (← links)
- Packing odd circuits in Eulerian graphs (Q1403922) (← links)
- A characterization of weakly bipartite graphs (Q1850558) (← links)
- Testing idealness in the filter oracle model (Q2102851) (← links)
- Total dual dyadicness and dyadic generating sets (Q2164668) (← links)
- The minimally non-ideal binary clutters with a triangle (Q2338610) (← links)
- On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs (Q2340339) (← links)
- A short proof of Shih's isomorphism theorem on graphic subspaces (Q2663417) (← links)
- Perfect and Ideal 0, ±1 Matrices (Q2757536) (← links)
- (Q2816093) (← links)
- Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids (Q2820860) (← links)
- (Q3191865) (← links)
- (Q3439690) (← links)
- Lehman's Theorem and the Directed Steiner Tree Problem (Q3462549) (← links)
- (Q3840342) (← links)
- (Q3840343) (← links)
- (Q4537698) (← links)
- (Q4537745) (← links)
- Packing odd <i>T</i>‐joins with at most two terminals (Q4638649) (← links)
- (Q4737527) (← links)
- Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour (Q4785688) (← links)
- Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids (Q4910816) (← links)
- Recognizing Even-Cycle and Even-Cut Matroids (Q5041745) (← links)
- Clean Clutters and Dyadic Fractional Packings (Q5071103) (← links)
- Relationships between Pairs of Representations of Signed Binary Matroids (Q5300498) (← links)
- The Cycling Property for the Clutter of Odd st-Walks (Q5418980) (← links)
- Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids (Q5704104) (← links)
- The two-point Fano and ideal binary clutters (Q5919715) (← links)
- The two-point Fano and ideal binary clutters (Q5920067) (← links)
- The packing property. (Q5926333) (← links)
- On dijoins (Q5957710) (← links)
- Recognizing even-cycle and even-cut matroids (Q6052071) (← links)
- Small separations in pinch-graphic matroids (Q6120837) (← links)
- Recognizing pinch-graphic matroids (Q6120838) (← links)
- Testing idealness in the filter oracle model (Q6391161) (← links)
- Dyadic linear programming and extensions (Q6450476) (← links)