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

MaRDI QIDQ6387451zbMATH OpenFDO

Authors Pham Hoang Ha

Publication date 4 January 2022

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

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

This page was built for publication: Spanning trees of $K_{1,4}$-free graphs with a bounded number of leaves and branch vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6387451)