Determining the minimum rank of matroids whose basis graph is common
From MaRDI portal
Publication:5300997
DOI10.1016/j.endm.2008.06.028zbMath1267.05056OpenAlexW1986951898MaRDI QIDQ5300997
Masahiro Hachimori, Tadashi Sakuma, Hiroshi Kurata
Publication date: 28 June 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2008.06.028
Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Paths and cycles in matroid base graphs
- Properties of Euclidean and non-Euclidean distance matrices
- A lower bound on connectivities of matroid base graphs
- A characterization of complete matroid base graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Matroid basis graphs. I
- Matroid basis graphs. II
- Families of matroids induced by classes of graphs
- A Graphical Representation of Matroids