Super 3-restricted edge connectivity of triangle-free graphs. (Q2822822)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6632785
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Super 3-restricted edge connectivity of triangle-free graphs. |
scientific article; zbMATH DE number 6632785 |
Statements
5 October 2016
0 references
edge connectivity
0 references
3-restricted edge connectivity
0 references
triangle-free graph
0 references
degree sequence
0 references
fault tolerance
0 references
0 references
0.9290782
0 references
0.9143102
0 references
0.90601766
0 references
0.90003204
0 references
0.89664376
0 references
0.89596134
0 references
0.8959153
0 references
Super 3-restricted edge connectivity of triangle-free graphs. (English)
0 references
