On the Maximum Diameter of Path-Pairable Graphs
Crossref DOI link: https://doi.org/10.1007/s00373-019-02099-y
Published Online: 2019-09-14
Published Print: 2019-11
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Girão, António
Popielarz, Kamil
Mészáros, Gábor
Snyder, Richard
Text and Data Mining valid from 2019-09-14
Version of Record valid from 2019-09-14
Article History
Received: 30 July 2018
Revised: 2 September 2019
First Online: 14 September 2019