AbstractWe characterize all internally 4-connected binary matroids M with the property that the ground set of M can be ordered (e0,…,en−1) in such a way that {ei,…,ei+t} is 4-separating for all 0≤i,t≤n−1 (all subscripts are read modulo n). We prove that in this case either n≤7 or, up to duality, M is isomorphic to the polygon matroid of a cubic or quartic planar ladder, the polygon matroid of a cubic or quartic Möbius ladder, a particular single-element extension of a wheel, or a particular single-element extension of the bond matroid of a cubic ladder
AbstractWe prove that, if M is a weakly 4-connected matroid with |E(M)|⩾7 and neither M nor M∗ is is...
Abstract. In our quest to find a splitter theorem for internally 4-connected binary matroids, we pro...
Let M be a 3-connected binary matroid; M is called internally 4-connected if one side of every 3-sep...
We characterize all internally 4-connected binary matroids M with the property that the ground set o...
AbstractWe characterize all internally 4-connected binary matroids M with the property that the grou...
Abstract. We characterize all internally 4-connected binary matroids M with the property that the gr...
AbstractLet M be a matroid. When M is 3-connected, Tutte's Wheels-and-Whirls Theorem proves that M h...
AbstractA 3-separation (A, B), in a matroid M, is called sequential if the elements of A can be orde...
Oxley, Semple and Whittle described a tree decomposition for a 3-connected matroid M that displays, ...
Let M be a matroid. When M is 3-connected, Tutte\u27s Wheels-and-Whirls Theorem proves that M has a ...
AbstractTutte's Wheels-and-Whirls Theorem proves that if M is a 3-connected matroid other than a whe...
Abstract In our quest to find a splitter theorem for internally 4-connected binary matroids, we prov...
This paper proves a preliminary step towards a splitter theorem for internally 4-connected binary ma...
Let M be an internally 4-connected binary matroid with every element in exactly three triangles. The...
In an earlier paper, we proved that an internally 4-connected binary matroid with at least seven ele...
AbstractWe prove that, if M is a weakly 4-connected matroid with |E(M)|⩾7 and neither M nor M∗ is is...
Abstract. In our quest to find a splitter theorem for internally 4-connected binary matroids, we pro...
Let M be a 3-connected binary matroid; M is called internally 4-connected if one side of every 3-sep...
We characterize all internally 4-connected binary matroids M with the property that the ground set o...
AbstractWe characterize all internally 4-connected binary matroids M with the property that the grou...
Abstract. We characterize all internally 4-connected binary matroids M with the property that the gr...
AbstractLet M be a matroid. When M is 3-connected, Tutte's Wheels-and-Whirls Theorem proves that M h...
AbstractA 3-separation (A, B), in a matroid M, is called sequential if the elements of A can be orde...
Oxley, Semple and Whittle described a tree decomposition for a 3-connected matroid M that displays, ...
Let M be a matroid. When M is 3-connected, Tutte\u27s Wheels-and-Whirls Theorem proves that M has a ...
AbstractTutte's Wheels-and-Whirls Theorem proves that if M is a 3-connected matroid other than a whe...
Abstract In our quest to find a splitter theorem for internally 4-connected binary matroids, we prov...
This paper proves a preliminary step towards a splitter theorem for internally 4-connected binary ma...
Let M be an internally 4-connected binary matroid with every element in exactly three triangles. The...
In an earlier paper, we proved that an internally 4-connected binary matroid with at least seven ele...
AbstractWe prove that, if M is a weakly 4-connected matroid with |E(M)|⩾7 and neither M nor M∗ is is...
Abstract. In our quest to find a splitter theorem for internally 4-connected binary matroids, we pro...
Let M be a 3-connected binary matroid; M is called internally 4-connected if one side of every 3-sep...