Spanning Trees with Many Leaves in Graphs With Minimum Degree Three (Q3393426)
From MaRDI portal
!
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 5597381
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Spanning Trees with Many Leaves in Graphs With Minimum Degree Three |
scientific article; zbMATH DE number 5597381 |
Statements
Spanning Trees with Many Leaves in Graphs With Minimum Degree Three (English)
0 references
20 August 2009
0 references
spanning tree
0 references
Max leaf
0 references
connected dominating set
0 references
extremal graph theory
0 references
0.911920726299286
0 references
0.901679754257202
0 references
0.8975193500518799
0 references
0.8952877521514893
0 references
0.895090639591217
0 references
