DOIAbstract
AbstractWe prove that if M is an internally 4-connected binary matroid with an M(K5)-minor and with no M(K3,3)-minor, then either M has rank 4, or M is isomorphic to one of the following matroids: T12, T12/e, T11˜, T12˜, and T13˜
AbstractWe prove that if M is an internally 4-connected binary matroid with an M(K5)-minor and with no M(K3,3)-minor, then either M has rank 4, or M is isomorphic to one of the following matroids: T12, T12/e, T11˜, T12˜, and T13˜
Let M be a 3-connected binary matroid; M is called internally 4-connected if one side of every 3-sep...
Abstract. Let AG(3, 2) 1 U1,1 denote the binary matroid obtained from AG(3, 2)⊕U1,1 by completing th...
Let M be a matroid. When M is 3-connected, Tutte\u27s Wheels-and-Whirls Theorem proves that M has a ...
AbstractWe prove that every internally 4-connected non-regular binary matroid other than F7 and F7∗ ...
AbstractWe prove that if N is an internally 4-connected proper minor of a weakly 4-connected binary ...
Let M and N be internally 4-connected binary matroids such that M has a proper N-minor, and |E (N) |...
AbstractWe prove that if M is an internally 4-connected binary matroid with an M(K5)-minor and with ...
This paper proves a preliminary step towards a splitter theorem for internally 4-connected binary ma...
We prove that if M is a 4-connected binary matroid and N is an internally 4-connected proper minor o...
Let M be a binary matroid that is internally 4-connected, that is, M is 3-connected, and one side of...
Abstract In our quest to find a splitter theorem for internally 4-connected binary matroids, we prov...
Let M be a 3-connected binary matroid; M is internally 4-connected if one side of every 3-separation...
AbstractD.W. Hall proved that every simple 3-connected graph with a K5-minor must have a K3.3-minor,...
Abstract Let M be an internally 4-connected binary matroid and N be an internally 4-connected proper...
AbstractLet M be a matroid. When M is 3-connected, Tutte's Wheels-and-Whirls Theorem proves that M h...
Let M be a 3-connected binary matroid; M is called internally 4-connected if one side of every 3-sep...
Abstract. Let AG(3, 2) 1 U1,1 denote the binary matroid obtained from AG(3, 2)⊕U1,1 by completing th...
Let M be a matroid. When M is 3-connected, Tutte\u27s Wheels-and-Whirls Theorem proves that M has a ...
AbstractWe prove that every internally 4-connected non-regular binary matroid other than F7 and F7∗ ...
AbstractWe prove that if N is an internally 4-connected proper minor of a weakly 4-connected binary ...
Let M and N be internally 4-connected binary matroids such that M has a proper N-minor, and |E (N) |...
AbstractWe prove that if M is an internally 4-connected binary matroid with an M(K5)-minor and with ...
This paper proves a preliminary step towards a splitter theorem for internally 4-connected binary ma...
We prove that if M is a 4-connected binary matroid and N is an internally 4-connected proper minor o...
Let M be a binary matroid that is internally 4-connected, that is, M is 3-connected, and one side of...
Abstract In our quest to find a splitter theorem for internally 4-connected binary matroids, we prov...
Let M be a 3-connected binary matroid; M is internally 4-connected if one side of every 3-separation...
AbstractD.W. Hall proved that every simple 3-connected graph with a K5-minor must have a K3.3-minor,...
Abstract Let M be an internally 4-connected binary matroid and N be an internally 4-connected proper...
AbstractLet M be a matroid. When M is 3-connected, Tutte's Wheels-and-Whirls Theorem proves that M h...
Let M be a 3-connected binary matroid; M is called internally 4-connected if one side of every 3-sep...
Abstract. Let AG(3, 2) 1 U1,1 denote the binary matroid obtained from AG(3, 2)⊕U1,1 by completing th...
Let M be a matroid. When M is 3-connected, Tutte\u27s Wheels-and-Whirls Theorem proves that M has a ...
Add to ORKG