Spanning Trees of Connected $$K_{1,t}$$-free Graphs Whose Stems Have a Few Leaves
Crossref DOI link: https://doi.org/10.1007/s40840-019-00812-x
Published Online: 2019-07-23
Published Print: 2020-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Ha, Pham Hoang
Hanh, Dang Dinh
Text and Data Mining valid from 2019-07-23
Version of Record valid from 2019-07-23
Article History
Received: 1 November 2018
Revised: 23 June 2019
First Online: 23 July 2019