Abstract
Let be a tree. A vertex of degree one is a \emph{leaf} of and a vertex of degree at least three is a \emph{branch vertex} of . A graph is said to be \emph{-free} if it does not contain as an induced subgraph. In this paper, we study the spanning trees with a bounded number of leaves and branch vertices of -free graphs. Applying the main results, we also give some improvements of previous results on the spanning tree with few branch vertices for the case of -free graphs.
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.