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

arXiv2303.02372MaRDI QIDQ6509040FDOQ6509040

Authors: Michitaka Furuya, Akira Saito, Shoichi Tsuchiya 

Abstract: 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, Hutchinson and Thomassen~[J. Graph Theory {�f 14} (1990), 247--258] gave a minimum degree condition for the existence of a HIST, and recently, Ito and Tsuchiya~[J. Graph Theory {�f 99} (2022), 162--170] found a sharp degree-sum condition for the existence of a HIST. In this paper, we refine these results in a sense, and extend the first one to a spanning tree without stems of small degree.

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

This page was built for publication: Refinements of degree conditions for 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 Q6509040)