论文部分内容阅读
Let T be a tree. The set of leaves of Τ is denoted by Leaf(Τ). The subtree Τ—Leaf(Τ) of T is called the stem of Τ. A stem is called a k-ended stem if it has at most k-leaves in it. In this paper, we prove the following theorem. Let G be a connected graph