Maximizing spanning trees in almost complete graphs (Q4355482)
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: Maximizing spanning trees in almost complete graphs |
scientific article; zbMATH DE number 1063795
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing spanning trees in almost complete graphs |
scientific article; zbMATH DE number 1063795 |
Statements
21 September 1997
0 references
finite graphs
0 references
paths
0 references
cycles
0 references
characterization
0 references
spanning trees
0 references
Maximizing spanning trees in almost complete graphs (English)
0 references
0.99999976
0 references
0.9449449
0 references
0.9438094
0 references
0.9438094
0 references
0.9218353
0 references
0 references
0.92082566
0 references
0.9186326
0 references
