A chain theorem for internally 4-connected binary matroids

DOI10.1016/j.jctb.2010.12.004zbMath1241.05012OpenAlexW1994560437MaRDI QIDQ716056

Dillon Mayhew, Carolyn Chun, James G. 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)

Related Items (14)

Towards a splitter theorem for internally 4-connected binary matroids. IX. The theorem. ⋮ 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 ⋮ Unnamed Item ⋮ Improving a chain theorem for triangle-free 3-connected matroids ⋮ Recognizing pinch-graphic matroids ⋮ An upgraded Wheels-and-Whirls theorem for 3-connected matroids ⋮ Towards a splitter theorem for internally 4-connected binary matroids ⋮ Towards a splitter theorem for internally 4-connected binary matroids. VII ⋮ Towards a splitter theorem for internally 4-connected binary matroids. VIII: Small matroids. ⋮ The Möbius matroids ⋮ Towards a splitter theorem for internally 4-connected binary matroids. VI ⋮ Internally 4-connected binary matroids without a prism+\(e\) minor

Cites Work

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

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