{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:27:29Z","timestamp":1755221249680,"version":"3.43.0"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>For an integer $k\\geq 2$, a spanning tree of a graph without vertices of degree from $2$ to $k$ is called a $[2,k]$-ST\u00a0of the graph. The concept of $[2,k]$-STs is a natural extension of a homeomorphically irreducible spanning tree (or HIST), which is 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 a degree-product condition for the existence of a $[2,k]$-ST.<\/jats:p>","DOI":"10.37236\/13074","type":"journal-article","created":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T14:10:52Z","timestamp":1754662252000},"source":"Crossref","is-referenced-by-count":0,"title":["A New Strategy for Finding Spanning Trees without Small Degree Stems"],"prefix":"10.37236","volume":"32","author":[{"given":"Michitaka","family":"Furuya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shoichi","family":"Tsuchiya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2025,8,8]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v32i3p23\/9332","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v32i3p23\/9332","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T14:10:53Z","timestamp":1754662253000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v32i3p23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,8]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,7,4]]}},"URL":"https:\/\/doi.org\/10.37236\/13074","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,8]]},"article-number":"P3.23"}}