A chain theorem for 4-connected matroids

DOI10.1016/j.jctb.2004.06.003zbMath1058.05015OpenAlexW2048456408MaRDI QIDQ707022

Rhiannon Hall

Publication date: 9 February 2005

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.06.003

zbMATH Keywords

3-connected matroids3-separatorChain theorem

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (9)

Improving a chain theorem for triangle-free 3-connected matroids ⋮ Recognizing pinch-graphic matroids ⋮ An upgraded Wheels-and-Whirls theorem for 3-connected matroids ⋮ A chain theorem for matroids ⋮ Generating weakly 4-connected matroids ⋮ A chain theorem for internally 4-connected binary matroids ⋮ Exposing 3-separations in 3-connected matroids ⋮ On matroids of branch-width three. ⋮ Rank connectivity and pivot-minors of graphs

Cites Work

• Unnamed Item
• Matroid 4-connectivity: A deletion-contraction theorem
• Branch-width and well-quasi-ordering in matroids and graphs.
• The structure of a 3-connected matroid with a 3-separating set of essential elements
• Connectivity in Matroids

This page was built for publication: A chain theorem for 4-connected matroids