On the 3-connected matroids that are minimal having a fixed restriction
Let N be a restriction of a 3-connected matroid M and let M′ be a 3-connected minor of M that is minimal having N as a restriction. This paper gives a best-possible upper bound on \E(M′)- E(N)\. © Springer-Verlag 2000.
Publication Source (Journal or Book title)
Graphs and Combinatorics
Lemos, M., Oxley, J., & Reid, T. (2000). On the 3-connected matroids that are minimal having a fixed restriction. Graphs and Combinatorics, 16 (3), 285-318. https://doi.org/10.1007/PL00007223