Closure and Spanning k-Trees

Ryota Matsubara, Masao Tsugaki, Tomoki Yamashita

研究成果: Article

1 引用 (Scopus)

抜粋

In this paper, we propose a new closure concept for spanning k-trees. A k-tree is a tree with maximum degree at most k. We prove that: Let G be a connected graph and let u and v be nonadjacent vertices of G. Suppose that (Formula presented) for every independent set S in G of order k with u, v ∈ S. Then G has a spanning k-tree if and only if G + uv has a spanning k-tree. This result implies Win's result (Abh Math Sem Univ Hamburg, 43:263-267, 1975) and Kano and Kishimoto's result (Graph Comb, 2013) as corollaries.

元の言語English
ページ(範囲)957-962
ページ数6
ジャーナルGraphs and Combinatorics
30
発行部数4
DOI
出版物ステータスPublished - 2014 6

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

フィンガープリント Closure and Spanning k-Trees' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用