Answers are grounded in this paper and cite their sources.
Let π be a tree, a vertex of degree one is called a leaf. The set of all leaves of π is denoted by Leaf(π). The subtree π β Leaf(π) of π is called the stem of π and denoted by Stem(π). A tree π is called a caterpillar if Stem(π) is a path. In this paper, we give two sufficient conditions for a connected graph to have a spanning tree whose stem is a caterpillar. We also give some examples to show that these conditions are sharp.
No takes yet. Share an insight, caveat, or question.
Ha et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: