Abstract
In this paper, we prove that every -vertex connected -free graph with contains a spanning tree with at most leaves and branch vertices in total. Moreover, the degree sum condition "" is best possible.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.