The minimum number of edges and vertices in a graph with edge connectivity π and π π-bonds (Q4773729): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) βChanged an Item Β |
||
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