Pages that link to "Item:Q1241754"
From MaRDI portal
The following pages link to The dependence graph for bases in matroids (Q1241754):
Displayed 24 items.
- Matroids and linking systems (Q599061) (← links)
- A decomposition theory for matroids. I: General results (Q801076) (← links)
- Matchings and \(\Delta\)-matroids (Q920097) (← links)
- A notion of cross-perfect bipartite graphs (Q1029000) (← links)
- Arbres minimaux d'un graphe preordonne (Q1053701) (← links)
- An augmenting path algorithm for linear matroid parity (Q1087880) (← links)
- Discrete convex analysis (Q1290668) (← links)
- On matroids without a non-Fano minor (Q1301675) (← links)
- Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings (Q1414591) (← links)
- Homogeneous multivariate polynomials with the half-plane property (Q1432999) (← links)
- A decomposition of the matroids with the max-flow min-cut property (Q1823147) (← links)
- On the efficiency of representability tests for matroids (Q1835922) (← links)
- The excluded minors for GF(4)-representable matroids (Q1850480) (← links)
- Partial matroid representations (Q2266019) (← links)
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids (Q2462380) (← links)
- On Rota's conjecture and excluded minors containing large projective geometries. (Q2490840) (← links)
- Unicycle graphs and uniquely restricted maximum matchings (Q3439344) (← links)
- The generalized column incidence graph and a matroid base-listing algorithm (Q3744172) (← links)
- Full transversal matroids, strict gammoids, and the matroid components problem (Q3744173) (← links)
- Strict matching matroids and matroid algorithms (Q3744174) (← links)
- (Q4200070) (← links)
- Some Small Circuit-Cocircuit Ramsey Numbers for Matroids (Q4844491) (← links)
- On matroid connectivity (Q5904771) (← links)
- Multimatroids. III: Tightness and fundamental graphs (Q5944005) (← links)