A condition ensuring that a connected graph has a spanning tree with few leaves
Crossref DOI link: https://doi.org/10.1007/s40879-023-00624-1
Published Online: 2023-04-10
Published Print: 2023-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Hanh, Dang Dinh
Text and Data Mining valid from 2023-04-10
Version of Record valid from 2023-04-10
Article History
Received: 17 March 2022
Revised: 28 July 2022
Accepted: 6 September 2022
First Online: 10 April 2023
Declarations
:
: The authors declare that they have no conflict of interest.