Spanning trees with many leaves: lower bounds in terms of the number of vertices of degree 1, 3 and at least 4 (Q744554)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Spanning trees with many leaves: lower bounds in terms of the number of vertices of degree 1, 3 and at least 4 |
scientific article |
Statements
Spanning trees with many leaves: lower bounds in terms of the number of vertices of degree 1, 3 and at least 4 (English)
0 references
25 September 2014
0 references
spanning tree
0 references
