1 citations · 2 across the 7 of their papers we have counts for
1 paper · 1 filter
Pham Hoang Ha, Nguyen Hoang Trang
In this paper, we prove that every n-vertex connected K1,5-free graph G with σ4(G)≥n−1 contains a spanning tree with at most 5 leaves and branch vertices in total…