Search Results
You are looking at 1 - 2 of 2 items for
- Author or Editor: Dang Dinh Hanh x
- Refine by Access: All Content x
Studia Scientiarum Mathematicarum Hungarica
Author:
Dang Dinh Hanh
A leaf of a tree is a vertex of degree one and a branch vertex of a tree is a vertex of degree at least three. In this paper, we show a degree condition for a claw-free graph to have spanning trees with at most five branch vertices and leaves in total. Moreover, the degree sum condition is best possible.
Studia Scientiarum Mathematicarum Hungarica
Authors:
Pham Hoang Ha
,
Dang Dinh Hanh
,
Le Dinh Nam
, and
Nguyen Huu Nhan
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.
