Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs (Q5918150)
From MaRDI portal
scientific article; zbMATH DE number 7074147
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs |
scientific article; zbMATH DE number 7074147 |
Statements
Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs (English)
0 references
27 June 2019
0 references
spanning tree
0 references
leaf
0 references
degree sum
0 references
\(k_{1
0 references
5}\)-free
0 references
