Minimally 3-connected binary matroids

DOI10.1016/j.ejc.2007.07.006zbMath1158.05019OpenAlexW2050456793MaRDI QIDQ942146

Haidong Wu, Joe Anderson

Publication date: 4 September 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.07.006

zbMATH Keywords

Fano dualminimal 3 connected binary matroidsminimal 3 connected graphsminimally 3 connected matroidsspoked wheel

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Related Items

\(N\)-critical matroids ⋮ On minor-minimally 3-connected binary matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Minimally 3-connected graphs
• On 3-connected matroids
• Decomposition of regular matroids
• A simple theorem on 3-connectivity
• On the structure of 3-connected matroids and graphs
• ON MATROID CONNECTIVITY
• On Connectivity in Matroids and Graphs
• On Vertex-Triads in 3-Connected Binary Matroids
• Weakly 3-Connected Graphs
• Connectivity in Matroids
• On matroid connectivity