Generating weakly 4-connected matroids

DOI10.1016/j.jctb.2007.09.002zbMath1143.05015OpenAlexW1964757115MaRDI QIDQ2483478

Jim Geelen, Xiangqian Zhou

Publication date: 28 April 2008

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.2007.09.002

zbMATH Keywords

4-connectivityWheels and Whirls theorem

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (9)

Towards a splitter theorem for internally 4-connected binary matroids. III ⋮ Towards a splitter theorem for internally 4-connected binary matroids. V ⋮ Recognizing pinch-graphic matroids ⋮ An upgraded Wheels-and-Whirls theorem for 3-connected matroids ⋮ Generating an internally 4-connected binary matroid from another ⋮ A chain theorem for matroids ⋮ A chain theorem for internally 4-connected binary matroids ⋮ Strengthened chain theorems for different versions of 4-connectivity ⋮ Rank connectivity and pivot-minors of graphs

Cites Work

• A chain theorem for 4-connected matroids
• Decomposition of regular matroids
• Matroid 4-connectivity: A deletion-contraction theorem
• Generating internally four-connected graphs
• Connectivity in Matroids
• A Splitter Theorem for Internally 4‐Connected Binary Matroids

This page was built for publication: Generating weakly 4-connected matroids