Matroid 4-connectivity: A deletion-contraction theorem

DOI10.1006/JCTB.2001.2032zbMATH Open1028.05021OpenAlexW2060877605MaRDI QIDQ1850554FDOQ1850554

James F. Geelen, Geoff Whittle

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2001.2032

Recommendations

• Exposing 3-separations in 3-connected matroids
• The structure of the 4-separations in 4-connected matroids
• An upgraded Wheels-and-Whirls theorem for 3-connected matroids
• Generating weakly 4-connected matroids
• A chain theorem for matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Decomposition of regular matroids
• Title not available (Why is that?)
• A simple theorem on 3-connectivity
• Generating internally four-connected graphs
• Connectivity in Matroids
• On the Uniqueness of Matroid Representations Over GF(4)
• Title not available (Why is that?)
• On inequivalent representations of matroids over finite fields
• Generalized \(\Delta\text{--}Y\) exchange and \(k\)-regular matroids

Cited In (21)

• An upgraded Wheels-and-Whirls theorem for 3-connected matroids
• On contracting hyperplane elements from a 3-connected matroid
• The structure of the 3-separations of 3-connected matroids
• Exposing 3-separations in 3-connected matroids
• The structure of 3-connected matroids of path width three
• Constructive characterizations of 3-connected matroids of path width three
• Stability, fragility, and Rota's conjecture
• A chain theorem for 4-connected matroids
• Fork-decompositions of matroids
• Wild triangles in 3-connected matroids
• A chain theorem for matroids
• Generating weakly 4-connected matroids
• Recent work in matroid representation theory
• Generating an internally 4-connected binary matroid from another
• A chain theorem for internally 4-connected binary matroids
• On matroids of branch-width three.
• The structure of \(\{U_{2,5}, U_{3,5}\}\)-fragile matroids
• Improving a chain theorem for triangle-free 3-connected matroids
• Generating internally four-connected graphs
• On minimally \(k\)-connected matroids
• A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors

This page was built for publication: Matroid 4-connectivity: A deletion-contraction theorem

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