On internally 4-connected non-regular binary matroids

DOI10.1016/j.jctb.2004.03.001zbMath1051.05027OpenAlexW1977553725MaRDI QIDQ598474

Xiangqian Zhou

Publication date: 6 August 2004

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

zbMATH Keywords

Blocking sequenceBranch-widthFundamental graphInternally-4 connectedMatroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

On binary matroids without a \(P_{10}\)-minor ⋮ The binary matroids with no odd circuits of size exceeding five ⋮ Towards a splitter theorem for internally 4-connected binary matroids. III ⋮ Towards a splitter theorem for internally 4-connected binary matroids ⋮ Matroids with at least two regular elements ⋮ Generating an internally 4-connected binary matroid from another ⋮ Towards a splitter theorem for internally 4-connected binary matroids. II ⋮ Characterizing binary matroids with no \(P_9\)-minor ⋮ A note on binary matroid with no \(M(K_{3,3})\)-minor ⋮ Towards a splitter theorem for internally 4-connected binary matroids. VIII: Small matroids. ⋮ Equivalence-free exhaustive generation of matroid representations ⋮ The Möbius matroids ⋮ A chain theorem for internally 4-connected binary matroids ⋮ The Internally 4-Connected Binary Matroids With No 𝑀(𝐾_{3,3})-Minor. ⋮ A new proof for a result of Kingan and Lemos'

Cites Work

• Unnamed Item
• Unnamed Item
• On the excluded minors for matroids of branch-width three
• Decomposition of regular matroids
• Principally unimodular skew-symmetric matrices
• A generalization of a graph result of D. W. Hall
• The excluded minors for GF(4)-representable matroids
• On matroids of branch-width three.
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• The Binary Matroids With No 4-Wheel Minor