The following pages link to Decomposition of regular matroids (Q1144028):
Displayed 50 items.
- The regular matroids with no 5-wheel minor (Q580348) (← links)
- On internally 4-connected non-regular binary matroids (Q598474) (← links)
- Tutte polynomials computable in polynomial time (Q686299) (← links)
- Planar graphs with no 6-wheel minor (Q687108) (← links)
- The anti-join composition and polyhedra (Q688264) (← links)
- Almost-graphic matroids (Q696817) (← links)
- Ideal clutters (Q697573) (← links)
- Linear quadratic programming in oriented matroids (Q760437) (← links)
- On the intersections of circuits and cocircuits in matroids (Q762168) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- A note on nongraphic matroids (Q801072) (← links)
- A decomposition theory for matroids. I: General results (Q801076) (← links)
- A hierarchy of totally unimodular matrices (Q802628) (← links)
- Circuits and cocircuits in regular matroids (Q855306) (← links)
- Enumerating orientations of the free spikes (Q872046) (← links)
- On the circuit-cocircuit intersection conjecture (Q882788) (← links)
- Combinatorial geometries representable over GF(3) and GF(q). II: Dowling geometries (Q915122) (← links)
- Maintaining 3-connectivity relative to a fixed basis (Q928773) (← links)
- Relations between the circumference and \(e\)-circumference of a matroid (Q937245) (← links)
- Constructive characterizations of 3-connected matroids of path width three (Q942135) (← links)
- Minimally 3-connected binary matroids (Q942146) (← links)
- A characterization of some graph classes using excluded minors (Q950291) (← links)
- The signed-graphic representations of wheels and whirls (Q952641) (← links)
- Contracting an element from a cocircuit (Q953901) (← links)
- Some open problems on excluding a uniform matroid (Q953908) (← links)
- Removing circuits in 3-connected binary matroids (Q1011697) (← links)
- The decomposition of the hypermetric cone into \(L\)-domains (Q1024277) (← links)
- On clone sets of \(GF(q)\)-representable matroids (Q1024496) (← links)
- The 3-connected binary matroids with circumference 6 or 7 (Q1041600) (← links)
- On the representability of totally unimodular matrices on bidirected graphs (Q1044979) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- On theories of Whitney and Tutte (Q1070237) (← links)
- A characterization of the ternary matroids with no \(M(K_ 4)\)-minor (Q1071023) (← links)
- Minors of 3-connected matroids (Q1079571) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- Semi-duality and the cycle double cover conjecture (Q1085163) (← links)
- A decomposition theory for matroids. II. Minimal violation matroids (Q1086241) (← links)
- A decomposition theory for matroids. III. Decomposition conditions (Q1086242) (← links)
- Triples in matroid circuits (Q1086243) (← links)
- On chains of 3-connected matroids (Q1086571) (← links)
- Decomposition and optimization over cycles in binary matroids (Q1089347) (← links)
- On ternary transversal matroids (Q1092053) (← links)
- Adjacency in binary matroids (Q1093647) (← links)
- Short cocircuits in binary matroids (Q1101114) (← links)
- A construction for binary matroids (Q1102297) (← links)
- Recognizing max-flow min-cut path matrices (Q1103514) (← links)
- A decomposition theory for matroids. V: Testing of matrix total unimodularity (Q1103625) (← links)
- Strong unimodularity for matrices and hypergraphs (Q1104339) (← links)
- Optima of dual integer linear programs (Q1105488) (← links)
- Chordal characterization of graphic matroids (Q1109781) (← links)