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

Shun ichi Maezawa, Ryota Matsubara, Haruhide Matsuda

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Article number112260
JournalDiscrete Mathematics
Issue number4
Publication statusPublished - 2021 Apr


  • Fan-type degree condition
  • Hamilton-connected
  • Spanning tree
  • k-leaf-connected

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'A Fan-type condition for graphs to be k-leaf-connected'. Together they form a unique fingerprint.

Cite this