Refinements of degree conditions for the existence of a spanning tree without small degree stems
Preprint
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 {\bf 14} (1990), 247--258] gave a minimum degree condition for the existence of a HIST, and recently, Ito and Tsuchiya~[J. Graph Theory {\bf 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.
Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Characterization of graphs of diameter 2 containing a homeomorphically irreducible spanning treeJournal of Graph Theory, 2023
- Degree sum conditions for the existence of homeomorphically irreducible spanning treesJournal of Graph Theory, 2021
- Homeomorphically irreducible spanning trees in hexangulations of surfacesDiscrete Mathematics, 2019
- Large homeomorphically irreducible trees in path‐free graphsJournal of Graph Theory, 2019
- On homeomorphically irreducible spanning trees in cubic graphsJournal of Graph Theory, 2018
- Forbidden subgraphs and the existence of a spanning tree without small degree stemsDiscrete Mathematics, 2013
- Homeomorphically irreducible spanning treesJournal of Combinatorial Theory, Series B, 2013
- Homeomorphically Irreducible Spanning Trees in Locally Connected GraphsCombinatorics, Probability and Computing, 2012
- Graphs with homeomorphically irreducible spanning treesJournal of Graph Theory, 1990