Refinements of degree conditions for the existence of a spanning tree without small degree stems

Michitaka Furuya, Akira Saito, Shoichi Tsuchiya

A spanning tree of a graph without no vertices of degree $2$ is called a {\it homeomorphically irreducible spanning tree} (or a {\it HIST}) of the graph. Albertson, Berman, Hutchin…