Degree Bounded Spanning Trees

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 S ⊆ V(G) of cardinality n(k − 1) + c + 2, there exists a vertex set X ⊆ S of cardinality k such that the degree sum of vertices

• Type: Journal
• Year: 2010
• Where: GC
• Authors: Jun Fujisawa, Hajime Matsumura, Tomoki Yamashita
• Keywords: Applied Computing, GC 2010, N-connected Graph, Paper, Sufficient Condition