16 citations · 16 across the 2 of their papers we have counts for
1 paper · 1 filter
Paul Bonsma, Florian Zickfeld
It is known that graphs on n vertices with minimum degree at least 3 have spanning trees with at least n/4+2 leaves and that this can be improved to (n+4)/3 for cubic graphs withou…