Connectivity preserving trees in <i>k</i>‐connected or <i>k</i>‐edge‐connected graphs (Q6046680)
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: Connectivity preserving trees in k‐connected or k‐edge‐connected graphs |
scientific article; zbMATH DE number 7746576
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connectivity preserving trees in <i>k</i>‐connected or <i>k</i>‐edge‐connected graphs |
scientific article; zbMATH DE number 7746576 |
Statements
Connectivity preserving trees in <i>k</i>‐connected or <i>k</i>‐edge‐connected graphs (English)
0 references
6 October 2023
0 references
connectivity
0 references
\(k\)-connected graphs
0 references
\(k\)-edge-connected graphs
0 references
trees
0 references
0.9116698503494264
0 references
0.8757181763648987
0 references
0.8710260391235352
0 references
0.8611970543861389
0 references
0.8457955718040466
0 references
