Distance hereditary graphs G of connectivity two or three and diam(G) = diam(G̅) = 3 are reconstructible
Crossref DOI link: https://doi.org/10.1007/s13226-019-0339-2
Published Online: 2019-05-23
Published Print: 2019-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Devi Priya, P.
Monikandan, S.
Text and Data Mining valid from 2019-05-23
Version of Record valid from 2019-05-23
Article History
Received: 9 April 2017
Revised: 7 March 2018
Accepted: 12 July 2018
First Online: 23 May 2019