抄録
Let k ≥ 2 be an integer. We show that if G is a (k + 1)-connected graph and each pair of nonadjacent vertices in G has degree sum at least |G| + 1, then for each subset S of V(G) with |S| = k, G has a spanning tree such that S is the set of endvertices. This result generalizes Ore's theorem which guarantees the existence of a Hamilton path connecting any two vertices.
| 本文言語 | English |
|---|---|
| ページ（範囲） | 13-18 |
| ページ数 | 6 |
| ジャーナル | Graphs and Combinatorics |
| 巻 | 24 |
| 号 | 1 |
| DOI | |
| 出版ステータス | Published - 2008 2月 |
| 外部発表 | はい |
ASJC Scopus subject areas
- 理論的コンピュータサイエンス
- 離散数学と組合せ数学