On packing minors into connected matroids

DOI10.1016/S0012-365X(98)00055-7zbMath0956.05029OpenAlexW2005977392MaRDI QIDQ1584372

Manoel Lemos, James G. Oxley

Publication date: 2 November 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00055-7

zbMATH Keywords

minormatroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (7)

Elements belonging to triads in 3-connected matroids ⋮ On the minor-minimal 3-connected matroids having a fixed minor. ⋮ The 3-connected matroids with circumference 6 ⋮ On removable circuits in graphs and matroids ⋮ On the minor-minimal 2-connected graphs having a fixed minor ⋮ The 3-connected binary matroids with circumference 6 or 7 ⋮ Matroid 3-connectivity and branch width

Cites Work

• Unnamed Item
• A note on the production of matroid minors
• Extremal critically connected matroids
• Partial matroid representations
• On Connectivity in Matroids and Graphs
• Minimally 2-connected graphs.
• A Combinatorial Model for Series-Parallel Networks
• A Decomposition for Combinatorial Geometries

This page was built for publication: On packing minors into connected matroids