The dependence graph for bases in matroids
From MaRDI portal
Publication:1241754
DOI10.1016/0012-365X(77)90118-2zbMATH Open0366.05024MaRDI QIDQ1241754FDOQ1241754
Authors: Stein Krogdahl
Publication date: 1977
Published in: Discrete Mathematics (Search for Journal in Brave)
Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99) Algorithms in computer science (68W99)
Cites Work
Cited In (37)
- On the efficiency of representability tests for matroids
- The generalized column incidence graph and a matroid base-listing algorithm
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- A decomposition of the matroids with the max-flow min-cut property
- Multimatroids. III: Tightness and fundamental graphs
- Unicycle graphs and uniquely restricted maximum matchings
- Pareto Stable Matchings under One-Sided Matroid Constraints
- Partial matroid representations
- The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
- Title not available (Why is that?)
- A decomposition theory for matroids. I: General results
- Arbres minimaux d'un graphe preordonne
- On duality between local maximum stable sets of a graph and its line-graph
- Matroid Intersection under Restricted Oracles
- Strict matching matroids and matroid algorithms
- Homogeneous multivariate polynomials with the half-plane property
- Matroids and linking systems
- On matroids without a non-Fano minor
- Dependencies among dependencies in matroids
- Title not available (Why is that?)
- On Rota's conjecture and excluded minors containing large projective geometries.
- Some Small Circuit-Cocircuit Ramsey Numbers for Matroids
- Local maximum stable set greedoids stemming from very well-covered graphs
- Discrete convex analysis
- A notion of cross-perfect bipartite graphs
- Unbreakable matroids
- An augmenting path algorithm for linear matroid parity
- The excluded minors for GF(4)-representable matroids
- Market Pricing for Matroid Rank Valuations
- Full transversal matroids, strict gammoids, and the matroid components problem
- Matchings and \(\Delta\)-matroids
- Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs
- Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
- On matroid connectivity
- Obstructions for Bounded Branch-depth in Matroids
- On unicyclic graphs with uniquely restricted maximum matchings
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
This page was built for publication: The dependence graph for bases in matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1241754)