AbstractA matroid M is called minor-minimally 3-connected if M is 3-connected and, for each e∈E(M), either M∖e or M/e is not 3-connected. In this paper, we prove a chain theorem for the class of minor-minimally 3-connected binary matroids. As a consequence, we obtain a chain theorem for the class of minor-minimally 3-connected graphs
AbstractD.W. Hall proved that every simple 3-connected graph with a K5-minor must have a K3.3-minor,...
AbstractIn this paper, we prove a conjecture proposed by Leo: a large minimally 3-connected matroid ...
Let N be a minor of a 3-connected matroid M and let M′ be a 3-connected minor of M that is minimal h...
AbstractA matroid M is called minor-minimally 3-connected if M is 3-connected and, for each e∈E(M), ...
AbstractA 3-connected matroid M is said to be minimally 3-connected if, for any element e of M, the ...
AbstractLet N be a minor of a 3-connected matroid M such that no proper 3-connected minor of M has N...
Let N be a minor of a 3-connected matroid M such that no proper 3-connected minor of M has N as a mi...
AbstractIt is well known that a matroid is 2-connected if and only if every 2-element set is contain...
AbstractBy a well-known result of Tutte, if e is an element of a connected matroid M, then either th...
AbstractWhittle proved, for k=1,2, that if N is a 3-connected minor of a 3-connected matroid M, sati...
AbstractWe show that, for every integerngreater than two, there is a numberNsuch that every 3-connec...
By a well-known result of Tutte, if e is an element of a connected matroid M, then either the deleti...
AbstractTutte found an excluded minor characterization of graphic matroids with five excluded minors...
AbstractLet N be a minor of a 3-connected matroid M and let M′ be a 3-connected minor of M that is m...
AbstractA collection F of 3-connected matroids is triangle-rounded if, whenever M is a 3-connected m...
AbstractD.W. Hall proved that every simple 3-connected graph with a K5-minor must have a K3.3-minor,...
AbstractIn this paper, we prove a conjecture proposed by Leo: a large minimally 3-connected matroid ...
Let N be a minor of a 3-connected matroid M and let M′ be a 3-connected minor of M that is minimal h...
AbstractA matroid M is called minor-minimally 3-connected if M is 3-connected and, for each e∈E(M), ...
AbstractA 3-connected matroid M is said to be minimally 3-connected if, for any element e of M, the ...
AbstractLet N be a minor of a 3-connected matroid M such that no proper 3-connected minor of M has N...
Let N be a minor of a 3-connected matroid M such that no proper 3-connected minor of M has N as a mi...
AbstractIt is well known that a matroid is 2-connected if and only if every 2-element set is contain...
AbstractBy a well-known result of Tutte, if e is an element of a connected matroid M, then either th...
AbstractWhittle proved, for k=1,2, that if N is a 3-connected minor of a 3-connected matroid M, sati...
AbstractWe show that, for every integerngreater than two, there is a numberNsuch that every 3-connec...
By a well-known result of Tutte, if e is an element of a connected matroid M, then either the deleti...
AbstractTutte found an excluded minor characterization of graphic matroids with five excluded minors...
AbstractLet N be a minor of a 3-connected matroid M and let M′ be a 3-connected minor of M that is m...
AbstractA collection F of 3-connected matroids is triangle-rounded if, whenever M is a 3-connected m...
AbstractD.W. Hall proved that every simple 3-connected graph with a K5-minor must have a K3.3-minor,...
AbstractIn this paper, we prove a conjecture proposed by Leo: a large minimally 3-connected matroid ...
Let N be a minor of a 3-connected matroid M and let M′ be a 3-connected minor of M that is minimal h...
DOI
Add to ORKG