Crossmark

Decomposition of Complete Graphs into Arbitrary Trees

Crossref DOI link: https://doi.org/10.1007/s00373-021-02299-5

Published Online: 2021-05-01

Published Print: 2021-07

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Sethuraman, G. https://orcid.org/0000-0002-7240-523X
Murugan, V.
License Information

Text and Data Mining valid from 2021-05-01

Version of Record valid from 2021-05-01
More Information

Article History

Received: 5 August 2019

Revised: 8 August 2020

Accepted: 15 March 2021

First Online: 1 May 2021