New Bounds on Even Cycle Creating Hamiltonian Paths Using Expander Graphs
Crossref DOI link: https://doi.org/10.1007/s00493-020-4204-z
Published Online: 2020-03-05
Published Print: 2020-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Harcos, Gergely
Soltész, Daniel
Text and Data Mining valid from 2020-03-05
Version of Record valid from 2020-03-05
Article History
Received: 18 April 2019
Revised: 11 October 2019
First Online: 5 March 2020