Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph

Haruhide Matsuda, Kenta Ozeki, Tomoki Yamashita

研究成果: Article

13 引用 (Scopus)

抜粋

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' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用