Characterization of minimally \((2,l)\)-connected graphs (Q1944218): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 06:18, 5 March 2024

scientific article
Language Label Description Also known as
English
Characterization of minimally \((2,l)\)-connected graphs
scientific article

    Statements

    Characterization of minimally \((2,l)\)-connected graphs (English)
    0 references
    0 references
    0 references
    0 references
    4 April 2013
    0 references
    0 references
    combinatorial problems
    0 references
    connectivity
    0 references
    minimally \(k\)-connected graphs
    0 references
    \(l\)-connectivity
    0 references
    \((k,l)\)-connected graphs
    0 references
    minimally \((2,l)\)-connected graphs
    0 references