Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs (Q1045112)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs |
scientific article |
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
