Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected (Q894466)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sufficient conditions for triangle-free graphs to be super k-restricted edge-connected |
scientific article; zbMATH DE number 6515017
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected |
scientific article; zbMATH DE number 6515017 |
Statements
Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected (English)
0 references
1 December 2015
0 references
fault tolerance
0 references
restricted edge connectivity
0 references
super-restricted edge connectivity
0 references
triangle-free graph
0 references
0 references
0.9211037755012512
0 references
0.9196244478225708
0 references
0.9048158526420592
0 references
0.8944371938705444
0 references
0.8942467570304871
0 references
