On minor-minimally-connected matroids

DOI10.1016/0012-365X(84)90024-4zbMath0546.05021OpenAlexW2084988543MaRDI QIDQ798327

James G. Oxley

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90024-4

zbMATH Keywords

2-element cocircuitsconnected matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (6)

Some Local Extremal Connectivity Results for Matroids ⋮ Some extremal connectivity results for matroids ⋮ Zero-free regions for multivariate tutte polynomials (alias Potts-model partition functions) of graphs and matroids ⋮ Triads and triangles in 3-connected matroids ⋮ On coefficients of the Tutte polynomial ⋮ On extremal connectivity properties of unavoidable matroids

Cites Work

• Unnamed Item
• Unnamed Item
• On some extremal connectivity results for graphs and matroids
• Matroid representation over GF(3)
• Packing and covering with matroid circuits
• Extremal critically connected matroids
• On Connectivity in Matroids and Graphs
• Connectivity in Matroids
• Minimally 2-connected graphs.
• A higher invariant for matroids
• On Minimal Blocks
• A Combinatorial Model for Series-Parallel Networks

This page was built for publication: On minor-minimally-connected matroids