Spanning trees of K1,4K_{1,4}-free graphs with a bounded number of leaves and branch vertices

preprint2022arXivOpen access

Abstract

Let TT be a tree. A vertex of degree one is a \emph{leaf} of TT and a vertex of degree at least three is a \emph{branch vertex} of TT. A graph is said to be \emph{K1,4K_{1,4}-free} if it does not contain K1,4K_{1,4} as an induced subgraph. In this paper, we study the spanning trees with a bounded number of leaves and branch vertices of K1,4K_ {1,4}-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 K1,4K_{1,4}-free graphs.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.