In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for every independent set of cardinality n(k−1) + c + 2, there exists a vertex set of cardinality k such that the degree sum of vertices in X is at least |V(G)| − c −1. Then G has a spanning tree T with maximum degree at most and .
展开▼
机译：在本文中，我们为图具有度有界生成树提供了充分的条件。设n≥1，k≥3，c≥0，G为n连通图。假设对于基数n（k-1）+ c + 2的每个独立集合，存在基数k的顶点集，使得X中顶点的度和至少为| V（G）|。 -c -1。那么G有一个最大度为和的生成树T。
展开▼
