# Spanning trees with bounded total excess

Hikoe Enomoto, Yukichika Ohnishi, Katsuhiro Ota

2 被引用数 (Scopus)

## 抄録

Let c(H) denote the number of components of a graph H. Win proved in 1989 that if a connected graph G satisfies c(G\S)≤(k- 2)|S| + 2, for every subset S of V(G), then G has a spanning tree with maximum degree at most k. For a spanning tree T of a connected graph, the k-excess of a vertex v is defined to be max{0, degT(v) -k}. The total k-excess te(T, k) is the summation of the k-excesses of all vertices, namely, te(T, k) =Σ vεV(T)max{0. degT(v) - k}. This paper gives a sufficient condition for a graph to have a spanning tree with bounded total k-excess. Our main result is as follows. Suppose k ≥ 2, 6 ≥ 0, and G is a connected graph satisfying the following condition: For every subset S of V(G), c(G\S) ≤ (k-2)\S\ + 2 + b. Then, G has a spanning tree with total k-excess at most 6.

本文言語 English 289-295 7 Ars Combinatoria 102 Published - 2011 10月 1

• 数学 (全般)

## フィンガープリント

「Spanning trees with bounded total excess」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。