Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs (Q641183): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:20, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs |
scientific article |
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
