An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph (Q828980)
From MaRDI portal
!
WARNING
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 7344164
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph |
scientific article; zbMATH DE number 7344164 |
Statements
An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph (English)
0 references
5 May 2021
0 references
diameter
0 references
edge-connectivity
0 references
0.902801513671875
0 references
0.901236891746521
0 references
0.8729975819587708
0 references
0.8034616708755493
0 references
0.8011353015899658
0 references
