AbstractFor a k-connected graph or matroid M, where k is a fixed positive integer, we say that a subset X of E(M) is k-removable provided M∖X is k-connected. In this paper, we obtain a sharp condition on the size of a 3-connected binary matroid to have a 3-removable circuit
AbstractIn this paper, we prove a conjecture proposed by Leo: a large minimally 3-connected matroid ...
AbstractWe prove a conjecture of Welsh, that for every matroid M without coloops, ν(M) + θ(M) ≤ ϱ(M)...
AbstractLet M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this seri...
For a k-connected graph or matroid M, where k is a fixed positive integer, we say that a subset X of...
We show that if M is a connected binary matroid of cogirth at least five which does not have both an...
This paper proves several extremal results for 3-connected matroids. In particular, it is shown that...
AbstractIn this paper we prove the following theorem: Let M be a 3-connected matroid other than the ...
We show that for any 3-connected matroid M on a ground set of at least four elements such that M doe...
AbstractIt is well known that for any element of a connected matroid, either the deletion or the con...
Watkins and Mesner characterized edge-triples of a graph which are not in any circuit, and Chakravar...
AbstractFor a 3-connected binary matroid M, let dimA(M) be the dimension of the subspace of the cocy...
AbstractLemos and Oxley proved that if M is a connected matroid with |E(M)|⩾3r(M), then M has a circ...
AbstractIn this paper we answer a question of Oxley. We will show that if M is a 3-connected matroid...
AbstractThis paper proves several extremal results for 3-connected matroids. In particular, it is sh...
We prove that, for each nonnegative integer k and each matroid N, if M is a 3-connected matroid cont...
AbstractIn this paper, we prove a conjecture proposed by Leo: a large minimally 3-connected matroid ...
AbstractWe prove a conjecture of Welsh, that for every matroid M without coloops, ν(M) + θ(M) ≤ ϱ(M)...
AbstractLet M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this seri...
For a k-connected graph or matroid M, where k is a fixed positive integer, we say that a subset X of...
We show that if M is a connected binary matroid of cogirth at least five which does not have both an...
This paper proves several extremal results for 3-connected matroids. In particular, it is shown that...
AbstractIn this paper we prove the following theorem: Let M be a 3-connected matroid other than the ...
We show that for any 3-connected matroid M on a ground set of at least four elements such that M doe...
AbstractIt is well known that for any element of a connected matroid, either the deletion or the con...
Watkins and Mesner characterized edge-triples of a graph which are not in any circuit, and Chakravar...
AbstractFor a 3-connected binary matroid M, let dimA(M) be the dimension of the subspace of the cocy...
AbstractLemos and Oxley proved that if M is a connected matroid with |E(M)|⩾3r(M), then M has a circ...
AbstractIn this paper we answer a question of Oxley. We will show that if M is a 3-connected matroid...
AbstractThis paper proves several extremal results for 3-connected matroids. In particular, it is sh...
We prove that, for each nonnegative integer k and each matroid N, if M is a 3-connected matroid cont...
AbstractIn this paper, we prove a conjecture proposed by Leo: a large minimally 3-connected matroid ...
AbstractWe prove a conjecture of Welsh, that for every matroid M without coloops, ν(M) + θ(M) ≤ ϱ(M)...
AbstractLet M be a 3-connected matroid other than a wheel or a whirl. In the next paper in this seri...
DOI
Add to ORKG