New strategy on the existence of a spanning tree without small degree stems

arXiv2303.03762MaRDI QIDQ6509082FDOQ6509082

Authors: Michitaka Furuya, Shoichi Tsuchiya 

Abstract: For an integer $kgeq2$, a spanning tree of a graph without no vertices of degree from $2$ to $k$ is call a {it $[2,k]$-ST} of the graph. The concept of $[2,k]$-STs is a natural extension of a homeomorphically irreducible spanning tree (or HIST), which has been a well-studied graph-structure. In this paper, we give a new strategy for finding $[2,k]$-STs. By using the strategy, we refine or extend a known degree-sum condition for the existence of a HIST. Furthermore, we also investigate on a degree-product condition for the existence of a $[2,k]$-ST.

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

This page was built for publication: New strategy on the existence of a spanning tree without small degree stems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6509082)