Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4 (Q744553)
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: new lower bounds in terms of the number of vertices of degree 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: new lower bounds in terms of the number of vertices of degree 3 and at least 4 |
scientific article |
Statements
Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4 (English)
0 references
25 September 2014
0 references
regular graphs of degree 4
0 references
infinite series of graphs
0 references
0.962580680847168
0 references
0.911066472530365
0 references
0.9033044576644896
0 references
0.901679754257202
0 references
0.9009295105934144
0 references
