A chain theorem for 4-connected matroids

DOI10.1016/J.JCTB.2004.06.003MaRDI QIDQ707022zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A chain theorem for matroids
• A chain theorem for internally 4-connected binary matroids
• Generating weakly 4-connected matroids
• Partial matroid representations
• Matroid 3-connectivity and branch width

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• Branch-width and well-quasi-ordering in matroids and graphs.
• Connectivity in Matroids
• Matroid 4-connectivity: A deletion-contraction theorem
• The structure of a 3-connected matroid with a 3-separating set of essential elements

Cited in

(13)

• An upgraded Wheels-and-Whirls theorem for 3-connected matroids
• Exposing 3-separations in 3-connected matroids
• Strong splitter theorem
• Rank connectivity and pivot-minors of graphs
• A chain theorem for 4-connected graphs
• Recognizing pinch-graphic matroids
• A chain theorem for matroids
• Generating weakly 4-connected matroids
• A chain theorem for internally 4-connected binary matroids
• On matroids of branch-width three.
• Improving a chain theorem for triangle-free 3-connected matroids
• Refining a chain theorem from matroids to internally 4-connected graphs
• A Connection Problem for Simpson's Even Family of Rank Four

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

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