Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves

Shun ichi Maezawa, Ryota Matsubara, Haruhide Matsuda

研究成果: Article査読

抄録

A leaf of a tree is a vertex of degree one and a branch vertex of a tree is a vertex of degree strictly greater than two. This paper shows two degree conditions for graphs to have spanning trees with total bounded number of branch vertices and leaves. Moreover, the sharpness of our results is shown.

本文言語English
ページ(範囲)231-238
ページ数8
ジャーナルGraphs and Combinatorics
35
1
DOI
出版ステータスPublished - 2019 1 2

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

フィンガープリント 「Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル