Cite
HARVARD Citation
Han, J. et al. (2021). Finding any given 2‐factor in sparse pseudorandom graphs efficiently. Journal of graph theory. 96 (1), pp. 87-108. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Han, J. et al. (2021). Finding any given 2‐factor in sparse pseudorandom graphs efficiently. Journal of graph theory. 96 (1), pp. 87-108. [Online].