AbstractD.W. Hall proved that every simple 3-connected graph with a K5-minor must have a K3.3-minor, the only exception being K5 itself. In this paper, we prove that every 3-connected binary matroid with an M(K5)-minor must have an M(K3.3)- or M*(K3.3)-minor, the only exceptions being M(K5), a highly symmetric 12-element matroid which we call T12, and any single-element contraction of T12
AbstractA result of Walton and the author establishes that every 3-connected matroid of rank and cor...
AbstractWe prove that every internally 4-connected non-regular binary matroid other than F7 and F7∗ ...
This paper proves that, for every integernexceeding two, there is a numberN(n) such that every 3-con...
AbstractD.W. Hall proved that every simple 3-connected graph with a K5-minor must have a K3.3-minor,...
AbstractTutte found an excluded minor characterization of graphic matroids with five excluded minors...
AbstractWe show that, for every integerngreater than two, there is a numberNsuch that every 3-connec...
AbstractWe prove that, for each positive integer k, every sufficiently large 3-connected regular mat...
AbstractWe prove that if M is an internally 4-connected binary matroid with an M(K5)-minor and with ...
AbstractWhittle proved, for k=1,2, that if N is a 3-connected minor of a 3-connected matroid M, sati...
We show that, for every integer n greater than two, there is a number N such that every 3-connected ...
A result of Walton and the author establishes that every 3-connected matroid of rank and corank at l...
A result of Walton and the author establishes that every 3-connected matroid of rank and corank at l...
AbstractIt is well known that a matroid is 2-connected if and only if every 2-element set is contain...
In this paper, we give a complete characterization of binary matroids with no P9-minor. A 3-connecte...
This dissertation establishes a number of theorems related to the structure of graphs and, more gene...
AbstractA result of Walton and the author establishes that every 3-connected matroid of rank and cor...
AbstractWe prove that every internally 4-connected non-regular binary matroid other than F7 and F7∗ ...
This paper proves that, for every integernexceeding two, there is a numberN(n) such that every 3-con...
AbstractD.W. Hall proved that every simple 3-connected graph with a K5-minor must have a K3.3-minor,...
AbstractTutte found an excluded minor characterization of graphic matroids with five excluded minors...
AbstractWe show that, for every integerngreater than two, there is a numberNsuch that every 3-connec...
AbstractWe prove that, for each positive integer k, every sufficiently large 3-connected regular mat...
AbstractWe prove that if M is an internally 4-connected binary matroid with an M(K5)-minor and with ...
AbstractWhittle proved, for k=1,2, that if N is a 3-connected minor of a 3-connected matroid M, sati...
We show that, for every integer n greater than two, there is a number N such that every 3-connected ...
A result of Walton and the author establishes that every 3-connected matroid of rank and corank at l...
A result of Walton and the author establishes that every 3-connected matroid of rank and corank at l...
AbstractIt is well known that a matroid is 2-connected if and only if every 2-element set is contain...
In this paper, we give a complete characterization of binary matroids with no P9-minor. A 3-connecte...
This dissertation establishes a number of theorems related to the structure of graphs and, more gene...
AbstractA result of Walton and the author establishes that every 3-connected matroid of rank and cor...
AbstractWe prove that every internally 4-connected non-regular binary matroid other than F7 and F7∗ ...
This paper proves that, for every integernexceeding two, there is a numberN(n) such that every 3-con...
DOI
Add to ORKG