Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs (Q641183)
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: Spanning trees with at most k leaves in Kâ,4-free graphs |
scientific article; zbMATH DE number 5961723
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs |
scientific article; zbMATH DE number 5961723 |
Statements
Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs (English)
0 references
21 October 2011
0 references
spanning tree
0 references
leaf
0 references
degree sum
0 references
\(K_{1, 4}\)-free
0 references
spanning \(t\)-ended system
0 references
0.9135204553604126
0 references
0.8851699829101562
0 references
0.8768066167831421
0 references
0.8710486888885498
0 references
0.8622750043869019
0 references
