Article contents
On Minimally 3-Connected Binary Matroids
Published online by Cambridge University Press: 10 December 2001
Abstract
We generalize a minimal 3-connectivity result of Halin from graphs to binary matroids. As applications of this theorem to minimally 3-connected matroids, we obtain new results and short inductive proofs of results of Oxley and Wu. We also give new short inductive proofs of results of Dirac and Halin on minimally k-connected graphs for k ∈ {2,3}.
- Type
- Research Article
- Information
- Copyright
- 2001 Cambridge University Press
- 4
- Cited by