A Fan-type condition for graphs to be k-leaf-connected

Shun ichi Maezawa, Ryota Matsubara, Haruhide Matsuda

研究成果: Article査読

抄録

For k≥2, a graph G is said to be k-leaf connected if |G|>k and for each subset S of V(G) with |S|=k, G has a spanning tree T with precisely S as the set of endvertices of T. This property is a general concept of Hamiltonian-connected. This paper gives a Fan-type condition for graphs to be k-leaf-connected.

本文言語English
論文番号112260
ジャーナルDiscrete Mathematics
344
4
DOI
出版ステータスPublished - 2021 4

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • 離散数学と組合せ数学

フィンガープリント

「A Fan-type condition for graphs to be k-leaf-connected」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル