抜粋
Let k be a non-negative integer. A branch vertex of a tree is a vertex of degree at least three. We show two sufficient conditions for a connected claw-free graph to have a spanning tree with a bounded number of branch vertices: (i) A connected claw-free graph has a spanning tree with at most k branch vertices if its independence number is at most 2k + 2. (ii) A connected claw-free graph of order n has a spanning tree with at most one branch vertex if the degree sum of any five independent vertices is at least n - 2. These conditions are best possible. A related conjecture also is proposed.
| 元の言語 | English |
|---|---|
| ページ（範囲） | 429-437 |
| ページ数 | 9 |
| ジャーナル | Graphs and Combinatorics |
| 巻 | 30 |
| 発行部数 | 2 |
| DOI | |
| 出版物ステータス | Published - 2014 3 1 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
フィンガープリント Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。
これを引用
Matsuda, H., Ozeki, K., & Yamashita, T. (2014). Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph. Graphs and Combinatorics, 30(2), 429-437. https://doi.org/10.1007/s00373-012-1277-5