The minimum number of edges and vertices in a graph with edge connectivity ๐‘› and ๐‘š ๐‘›-bonds (Q4773729): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
โ€ŽRemoved claim: author (P16): Item:Q1002075
ReferenceBot (talk | contribs)
โ€ŽChanged an Item
ย 
(2 intermediate revisions by 2 users not shown)
Property / author
ย 
Property / author: Robert E. Bixby / rank
ย 
Normal rank
Property / MaRDI profile type
ย 
Property / MaRDI profile type: MaRDI publication profile / rank
ย 
Normal rank
Property / cites work
ย 
Property / cites work: Minimal kโ€arc connected graphs / rank
ย 
Normal rank
Property / cites work
ย 
Property / cites work: THE MAXIMUM CONNECTIVITY OF A GRAPH / rank
ย 
Normal rank
Property / cites work
ย 
Property / cites work: Q5726070 / rank
ย 
Normal rank
Property / cites work
ย 
Property / cites work: Q5524326 / rank
ย 
Normal rank
Property / cites work
ย 
Property / cites work: Lectures on matroids / rank
ย 
Normal rank
Property / cites work
ย 
Property / cites work: Network reliability analysis: Part I / rank
ย 
Normal rank

Latest revision as of 15:08, 12 June 2024

scientific article; zbMATH DE number 3450241
Language Label Description Also known as
English
The minimum number of edges and vertices in a graph with edge connectivity ๐‘› and ๐‘š ๐‘›-bonds
scientific article; zbMATH DE number 3450241

    Statements

    The minimum number of edges and vertices in a graph with edge connectivity ๐‘› and ๐‘š ๐‘›-bonds (English)
    0 references
    1974
    0 references
    0 references
    0 references