Spanning trees of a claw-free graph whose reducible stems have few leaves

Pham Hoang Ha

Let $T$ be a tree, a vertex of degree one is a leaf of $T$ and a vertex of degree at least three is a branch vertex of $T$. For two distinct vertices $u,v$ of $T$, let $P_T[u,v]$ d…