Bases-cobases graphs and polytopes of matroids
From MaRDI portal
Publication:684402
DOI10.1007/BF01303201zbMath0784.05018OpenAlexW2020148103MaRDI QIDQ684402
Raul Cordovil, Maria Leonor Moreira
Publication date: 15 September 1993
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01303201
Related Items (8)
On Serial Symmetric Exchanges of Matroid Bases ⋮ Serial exchanges in matroids ⋮ Cyclic orderings and cyclic arboricity of matroids ⋮ Weighted exchange distance of basis pairs ⋮ Partitioning into common independent sets via relaxing strongly base orderability ⋮ Disjoint compatible geometric matchings ⋮ Exchange Distance of Basis Pairs in Split Matroids ⋮ On Sequential Basis Exchange in Matroids
Cites Work
- On the number of common bases of two matroids
- Ordering of the elements of a matroid such that its consecutive w elements are independent
- Basis pair graphs of transversal matroids are connected
- Edge‐disjoint spanning trees: A connectedness theorem
- On the Facial Structure of Independence System Polyhedra
- Weak Maps of Combinatorial Geometries
- Matroids and the greedy algorithm
- Unnamed Item
- Unnamed Item
This page was built for publication: Bases-cobases graphs and polytopes of matroids