We characterize the 3-connected members of the intersection of the class of bicircular and cobi- circular matroids. Aside from some exceptional matroids with rank and corank at most 5, this class consists of just the free swirls and their minors
Matroid k-connectivity is typically defined in terms of a connectivity function. We can also say tha...
``If a theorem about graphs can be expressed in terms of edges and cycles only, it probably exemplif...
AbstractThis paper studies structural aspects of lattice path matroids. Among the basic topics treat...
We characterize the 3-connected members of the intersection of the class of bicircular and cobi- cir...
Matroids designs are defined to be matroids in which the hyperplanes all have the same size. The dua...
Young in his paper titled, Matroid Designs in 1973, reports that Murty in his paper titled, Equicard...
In this note we characterize all graphs without a 2C3-minor. A consequence of this result is a chara...
AbstractGiven a graph G, one can define a matroid M=(E,C) on the edges E of G with circuits C where ...
AbstractMatroidal families are defined as families of connected graphs such that, given any graph G,...
The first non-trivial case of Hadwiger's conjecture for oriented matroids reads as follows. If $\mat...
There are distinct differences between classes of matroids that are closed under principal extension...
AbstractWe prove that the class of C-matroids whose circuits intersect cocircuits on finite sets is ...
AbstractThis paper presents a polynomial-time algorithm for solving a restricted version of the reco...
A unified approach to prove former connectivity results of Tutte, Cunningham, Inukai and Weinberg, O...
AbstractTutte has defined n-connection for matroids and proved a connected graph is n-connected if a...
Matroid k-connectivity is typically defined in terms of a connectivity function. We can also say tha...
``If a theorem about graphs can be expressed in terms of edges and cycles only, it probably exemplif...
AbstractThis paper studies structural aspects of lattice path matroids. Among the basic topics treat...
We characterize the 3-connected members of the intersection of the class of bicircular and cobi- cir...
Matroids designs are defined to be matroids in which the hyperplanes all have the same size. The dua...
Young in his paper titled, Matroid Designs in 1973, reports that Murty in his paper titled, Equicard...
In this note we characterize all graphs without a 2C3-minor. A consequence of this result is a chara...
AbstractGiven a graph G, one can define a matroid M=(E,C) on the edges E of G with circuits C where ...
AbstractMatroidal families are defined as families of connected graphs such that, given any graph G,...
The first non-trivial case of Hadwiger's conjecture for oriented matroids reads as follows. If $\mat...
There are distinct differences between classes of matroids that are closed under principal extension...
AbstractWe prove that the class of C-matroids whose circuits intersect cocircuits on finite sets is ...
AbstractThis paper presents a polynomial-time algorithm for solving a restricted version of the reco...
A unified approach to prove former connectivity results of Tutte, Cunningham, Inukai and Weinberg, O...
AbstractTutte has defined n-connection for matroids and proved a connected graph is n-connected if a...
Matroid k-connectivity is typically defined in terms of a connectivity function. We can also say tha...
``If a theorem about graphs can be expressed in terms of edges and cycles only, it probably exemplif...
AbstractThis paper studies structural aspects of lattice path matroids. Among the basic topics treat...
DOI
Add to ORKG