A Splitter Theorem for Internally 4‐Connected Binary Matroids
From MaRDI portal
Publication:5757374
DOI10.1137/050629124zbMath1123.05025OpenAlexW1977521384MaRDI QIDQ5757374
Publication date: 6 September 2007
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050629124
Related Items
Recognizing Even-Cycle and Even-Cut Matroids, Towards a splitter theorem for internally 4-connected binary matroids. IX. The theorem., Towards a splitter theorem for internally 4-connected binary matroids. III, Improving a chain theorem for triangle-free 3-connected matroids, Recognizing even-cycle and even-cut matroids, Small separations in pinch-graphic matroids, Recognizing pinch-graphic matroids, An upgraded Wheels-and-Whirls theorem for 3-connected matroids, Generating an internally 4-connected binary matroid from another, Towards a splitter theorem for internally 4-connected binary matroids. II, Towards a splitter theorem for internally 4-connected binary matroids. VIII: Small matroids., Generating weakly 4-connected matroids, A chain theorem for internally 4-connected binary matroids, The Internally 4-Connected Binary Matroids With No 𝑀(𝐾_{3,3})-Minor., Rank connectivity and pivot-minors of graphs
