On size, circumference and circuit removal in 3-connected matroids
From MaRDI portal
Publication:1567617
DOI10.1016/S0012-365X(99)00379-9zbMath0951.05020MaRDI QIDQ1567617
Publication date: 13 December 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)
Related Items (9)
Elements belonging to triads in 3-connected matroids ⋮ An upper bound for the circumference of a 3-connected binary matroid ⋮ On the minor-minimal 3-connected matroids having a fixed minor. ⋮ Unnamed Item ⋮ The 3-connected matroids with circumference 6 ⋮ On removable circuits in graphs and matroids ⋮ Removing circuits in 3-connected binary matroids ⋮ Non-separating cocircuits in binary matroids ⋮ The 3-connected binary matroids with circumference 6 or 7
This page was built for publication: On size, circumference and circuit removal in 3-connected matroids
