Sciweavers

Share
GC
2010
Springer
9 years 9 months ago
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 eve...
Jun Fujisawa, Hajime Matsumura, Tomoki Yamashita
books