On Minimum Critically <i>n</i>-Edge-Connected Graphs (Q3784102): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A Graph-Theoretic Approach to a Communications Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximam critical n-edge connected graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterization of maximum critically 2-connected graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: THE MAXIMUM CONNECTIVITY OF A GRAPH / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5572939 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On maximum critically h-connected graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4739657 / rank | |||
Normal rank |
Latest revision as of 16:58, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On Minimum Critically <i>n</i>-Edge-Connected Graphs |
scientific article |
Statements
On Minimum Critically <i>n</i>-Edge-Connected Graphs (English)
0 references
1987
0 references
edge-connectivity
0 references