A chain theorem for internally 4-connected binary matroids

DOI10.1016/J.JCTB.2010.12.004MaRDI QIDQ716056zbMATH OpenOpenAlexFDO

Authors Carolyn Chun, Dillon Mayhew, James Oxley

Publication date 19 April 2011

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

Full work available at URL http://bura.brunel.ac.uk/handle/2438/7064

zbMATH Keywords

binary matroidinternally 4-connectedchain theorem

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• A chain theorem for matroids
• Towards a splitter theorem for internally 4-connected binary matroids. VI
• Towards a splitter theorem for internally 4-connected binary matroids. IV
• Towards a splitter theorem for internally 4-connected binary matroids. V
• Towards a splitter theorem for internally 4-connected binary matroids. II

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• A Splitter Theorem for Internally 4‐Connected Binary Matroids
• A chain theorem for 4-connected matroids
• A chain theorem for matroids
• A simple theorem on 3-connectivity
• Connectivity in Matroids
• Decomposition of regular matroids
• Generating internally four-connected graphs
• Generating weakly 4-connected matroids
• Matroid 4-connectivity: A deletion-contraction theorem
• On internally 4-connected non-regular binary matroids
• On the structure of 3-connected matroids and graphs
• The Internally 4-Connected Binary Matroids With No 𝑀(𝐾_{3,3})-Minor.
• The class of binary matroids with no \(M\)(\(K_{3,3}\))-, \(M^{*}\)(\(K_{3,3}\))-, \(M\)(\(K_{5}\))- or \(M^{*}\)(\(K_{5}\))-minor.
• The regular matroids with no 5-wheel minor
• The structure of the 3-separations of 3-connected matroids

Cited in

(25)

• A chain theorem for 4-connected graphs
• Towards a splitter theorem for internally 4-connected binary matroids. VII
• A chain theorem for matroids
• Generating weakly 4-connected matroids
• Towards a splitter theorem for internally 4-connected binary matroids. VIII: Small matroids.
• Refining a chain theorem from matroids to internally 4-connected graphs
• A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors
• Internally 4-connected binary matroids with every element in three triangles
• Improving a chain theorem for triangle-free 3-connected matroids
• Towards a splitter theorem for internally 4-connected binary matroids. III
• Towards a splitter theorem for internally 4-connected binary matroids. IV
• Towards a splitter theorem for internally 4-connected binary matroids. V
• An upgraded Wheels-and-Whirls theorem for 3-connected matroids
• Towards a splitter theorem for internally 4-connected binary matroids. VI
• A chain theorem for 4-connected matroids
• The internally 4-connected binary matroids with no \(M(K_{5}\setminus e)\)-minor
• Towards a splitter theorem for internally 4-connected binary matroids
• Recognizing pinch-graphic matroids
• The Internally 4-Connected Binary Matroids With No 𝑀(𝐾_{3,3})-Minor.
• Internally 4-connected binary matroids without a prism+\(e\) minor
• The Möbius matroids
• Towards a splitter theorem for internally 4-connected binary matroids. IX. The theorem.
• Constructing internally 4-connected binary matroids
• Extensions of Tutte's wheels-and-whirls theorem
• scientific article; zbMATH DE number 7352034 (Why is no real title available?)

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

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