On 3-connected matroids (Q1118602): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A simple theorem on 3-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur Theorie der n-fach zusammenhängenden Graphen / 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: 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 a matroid generalization of graph connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-Connected Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of regular matroids / 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

Latest revision as of 14:52, 19 June 2024

scientific article
Language Label Description Also known as
English
On 3-connected matroids
scientific article

    Statements

    On 3-connected matroids (English)
    0 references
    0 references
    1989
    0 references
    In this paper we answer a question of Oxley. We will show that if M is a 3-connected matroid and C is a circuit of M such that \(M\setminus e\) is not 3-connected for every \(e\in C\) then C meets at least two triads of M. We also give a generalization of Tutte's whirl and wheel theorem.
    0 references
    0 references
    3-connected matroid
    0 references
    Tutte's whirl and wheel theorem
    0 references