Matroid 4-connectivity: A deletion-contraction theorem

DOI10.1006/jctb.2001.2032zbMath1028.05021OpenAlexW2060877605MaRDI QIDQ1850554

James F. Geelen, Geoffrey P. 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

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (19)

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

Cites Work

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

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