A characterization of a class of non-binary matroids
From MaRDI portal
Publication:1111557
DOI10.1016/0095-8956(90)90025-UzbMath0658.05018MaRDI QIDQ1111557
Publication date: 1990
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
05B35: Combinatorial aspects of matroids and geometric lattices
Related Items
Non-Binary Matroids Having At Most Three Non-Binary Elements, Stability, fragility, and Rota's conjecture, Almost-graphic matroids, Matroids with many common bases., On the connectivity function of a binary matroid, Fan-extensions in fragile matroids, Signed-graphic matroids with all-graphic cocircuits, On two classes of nearly binary matroids, Families of matroids induced by classes of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A problem of P. Seymour on nonbinary matroids
- Decomposition of regular matroids
- Matroid representation over GF(3)
- On minors of non-binary matroids
- Recognizing graphic matroids
- On Nonbinary 3-Connected Matroids
- The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds
- The Forbidden Minors of Binary Clutters
- Connectivity in Matroids
- A Combinatorial Model for Series-Parallel Networks