@article{02748e7aee534280887e851f2d1c13db,
title = "A Fan-type condition for graphs to be k-leaf-connected",
abstract = "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.",
keywords = "Fan-type degree condition, Hamilton-connected, Spanning tree, k-leaf-connected",
author = "Maezawa, {Shun ichi} and Ryota Matsubara and Haruhide Matsuda",
note = "Funding Information: The authors would like to thank the referees for their valuable comments and suggestions. This work was supported by JSPS, Japan KAKENHI Grant Nos. JP20J15332 (to S. Maezawa) and JP20K03724 (to H. Matsuda and R. Matsubara). Publisher Copyright: {\textcopyright} 2020 Elsevier B.V.",
year = "2021",
month = apr,
doi = "10.1016/j.disc.2020.112260",
language = "English",
volume = "344",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "4",
}