Connectivity keeping trees in 2-connected graphs (Q2280001)
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 keeping trees in 2-connected graphs |
scientific article; zbMATH DE number 7143913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connectivity keeping trees in 2-connected graphs |
scientific article; zbMATH DE number 7143913 |
Statements
Connectivity keeping trees in 2-connected graphs (English)
0 references
17 December 2019
0 references
connectivity
0 references
caterpillar trees
0 references
isomorphic trees
0 references
2-connected graphs
0 references
0 references
0 references
0.96295965
0 references
0.96295965
0 references
0 references
0.92515886
0 references
0.9068609
0 references
0 references
0.89004433
0 references
