Bounds of the number of leaves of spanning trees in graphs without triangles (Q1930213)
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: Bounds of the number of leaves of spanning trees in graphs without triangles |
scientific article; zbMATH DE number 6124267
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds of the number of leaves of spanning trees in graphs without triangles |
scientific article; zbMATH DE number 6124267 |
Statements
Bounds of the number of leaves of spanning trees in graphs without triangles (English)
0 references
10 January 2013
0 references
number of leaves
0 references
spanning tree
0 references
0.9489416
0 references
0.9320752
0 references
0 references
0.91321707
0 references
0.90837365
0 references
0.90486944
0 references
0.90389276
0 references
0.90098184
0 references
