8 citations · 8 across the 2 of their papers we have counts for
1 paper · 1 filter
Anton Bankevich, Dmitri Karpov
We prove that every connected graph with s vertices of degree not 2 has a spanning tree with at least 41(s−2)+2 leaves. Let G be a be a connected graph of girth g w…