Search Results
You are looking at 1 - 1 of 1 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.
