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
 | 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 many leaves: lower bounds in terms of the number of vertices of degree 1, 3 and at least 4 |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.962580680847168
0 references
0.925109565258026
0 references
0.9066596627235411
0 references
0.9008110761642456
0 references
0.8995277285575867
0 references
