Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs (Q1045112)
From MaRDI portal
!
WARNING
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 5648150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs |
scientific article; zbMATH DE number 5648150 |
Statements
Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs (English)
0 references
15 December 2009
0 references
spanning tree
0 references
leaf
0 references
degree sum
0 references
\(K_{1,4}\)-free
0 references
0.8851699829101562
0 references
0.8835719227790833
0 references
0.8714883923530579
0 references
0.8687593340873718
0 references
0.8454757928848267
0 references
