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˜
In this paper, we give a complete characterization of binary matroids with no P9-minor. A 3-connecte...
AbstractD.W. Hall proved that every simple 3-connected graph with a K5-minor must have a K3.3-minor,...
Abstract. We prove that if N is an internally 4-connected minor of an internally 4-connected binary ...
AbstractWe prove that an internally 4-connected binary matroid with no minor isomorphic to M(K3,3),M...
Abstract. Let AG(3, 2) 1 U1,1 denote the binary matroid obtained from AG(3, 2)⊕U1,1 by completing th...
AbstractWe prove that if M is an internally 4-connected binary matroid with an M(K5)-minor and with ...
AbstractWe prove that if N is an internally 4-connected proper minor of a weakly 4-connected binary ...
We show that for every n ≥ 3 there is some number m such that every 4-connected binary matroid with ...
We show that for every n ≥ 3 there is some number m such that every 4-connected binary matroid with ...
We show that for every n ≥ 3 there is some number m such that every 4-connected binary matroid with ...
We show that for every n ≥ 3 there is some number m such that every 4-connected binary matroid with ...
The cycle matroids of wheels are the fundamental building blocks for the class of binary matroids. B...
AbstractWe prove that every internally 4-connected non-regular binary matroid other than F7 and F7∗ ...
It was proved by Oxley that U2,4 is the only non-trivial 3-connected matroid N such that, whenever a...
A result of Walton and the author establishes that every 3-connected matroid of rank and corank at l...
In this paper, we give a complete characterization of binary matroids with no P9-minor. A 3-connecte...
AbstractD.W. Hall proved that every simple 3-connected graph with a K5-minor must have a K3.3-minor,...
Abstract. We prove that if N is an internally 4-connected minor of an internally 4-connected binary ...
AbstractWe prove that an internally 4-connected binary matroid with no minor isomorphic to M(K3,3),M...
Abstract. Let AG(3, 2) 1 U1,1 denote the binary matroid obtained from AG(3, 2)⊕U1,1 by completing th...
AbstractWe prove that if M is an internally 4-connected binary matroid with an M(K5)-minor and with ...
AbstractWe prove that if N is an internally 4-connected proper minor of a weakly 4-connected binary ...
We show that for every n ≥ 3 there is some number m such that every 4-connected binary matroid with ...
We show that for every n ≥ 3 there is some number m such that every 4-connected binary matroid with ...
We show that for every n ≥ 3 there is some number m such that every 4-connected binary matroid with ...
We show that for every n ≥ 3 there is some number m such that every 4-connected binary matroid with ...
The cycle matroids of wheels are the fundamental building blocks for the class of binary matroids. B...
AbstractWe prove that every internally 4-connected non-regular binary matroid other than F7 and F7∗ ...
It was proved by Oxley that U2,4 is the only non-trivial 3-connected matroid N such that, whenever a...
A result of Walton and the author establishes that every 3-connected matroid of rank and corank at l...
In this paper, we give a complete characterization of binary matroids with no P9-minor. A 3-connecte...
AbstractD.W. Hall proved that every simple 3-connected graph with a K5-minor must have a K3.3-minor,...
Abstract. We prove that if N is an internally 4-connected minor of an internally 4-connected binary ...
Add to ORKG