On the 3-connected matroids that are minimal having a fixed spanning restriction

DOI10.1016/S0012-365X(99)00344-1zbMATH Open0946.05019OpenAlexW2005039625WikidataQ128012039 ScholiaQ128012039MaRDI QIDQ1978152FDOQ1978152

James Oxley, Manoel Lemos

Publication date: 24 July 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00344-1

zbMATH Keywords

minorrestriction3-connected matroidextremal connectivity result

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cited In (4)

• On the 3-connected matroids that are minimal having a fixed restriction
• On the number of non-isomorphic matroids
• On the minor-minimal 3-connected matroids having a fixed minor.
• Removing circuits in 3-connected binary matroids

   Recommendations

• On the 3-connected matroids that are minimal having a fixed restriction 👍 👎
• On the minor-minimal 3-connected matroids having a fixed minor. 👍 👎
• A minimal 3-connectedness result for matroids 👍 👎
• On minimally 3-connected binary matroids 👍 👎
• On 3-connected minors of 3-connected matroids and graphs 👍 👎
• On minor-minimally 3-connected binary matroids 👍 👎
• Minimally 3-connected binary matroids 👍 👎
• A minor-based characterization of matroid 3-connectivity 👍 👎
• On the structure of 3-connected matroids and graphs 👍 👎
• Minors of 3-connected matroids 👍 👎

This page was built for publication: On the 3-connected matroids that are minimal having a fixed spanning restriction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978152)