论文标题
跨越$ k_ {1,4} $的树 - 带有界数的叶子和分支顶点的免费图形
Spanning trees of $K_{1,4}$-free graphs with a bounded number of leaves and branch vertices
论文作者
论文摘要
令$ t $为一棵树。学位的顶点是$ t $的\ emph {leaf}，至少三个是$ t $的顶点。如果图形不包含$ k_ {1,4} $作为诱导子图，则据说为\ emph {$ k_ {1,4} $ - free}。在本文中，我们研究了带有$ k_ {1,4} $的叶子和分支顶点的跨越树。应用主要结果，我们还为$ k_ {1,4} $ - 免费图形的情况下的分支顶点提供了一些先前结果的改进。
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.
