A minimal 3-connectedness result for matroids (Q1195474): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Some extremal connectivity results for matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple theorem on 3-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjoints of binary matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-connected matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids with Sylvester property / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON MATROID CONNECTIVITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Connectivity in Matroids and Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-Connected Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5390304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and covering with matroid circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity in Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank

Revision as of 13:39, 16 May 2024

scientific article
Language Label Description Also known as
English
A minimal 3-connectedness result for matroids
scientific article

    Statements

    A minimal 3-connectedness result for matroids (English)
    0 references
    0 references
    6 December 1992
    0 references
    connectedness
    0 references
    matroid
    0 references

    Identifiers