An upper bound on the radius of a 3-edge-connected graph (Q5442174)
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 5238598
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound on the radius of a 3-edge-connected graph |
scientific article; zbMATH DE number 5238598 |
Statements
22 February 2008
0 references
radius of a graph
0 references
edge-connectivity
0 references
0.8727469444274902
0 references
0.8700166344642639
0 references
0.8700166344642639
0 references
