Alan Frieze, Pu Gao, Calum MacRury, Paweł Prałat, Gregory B. Sorkin. Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds. // European Journal of Combinatorics. – 2025. – DOI: 10.1016/j.ejc.2025.104122. – URL: https://doi.org/10.1016/j.ejc.2025.104122
Alan Frieze, Pu Gao, Calum MacRury, Paweł Prałat, & Gregory B. Sorkin (2025). Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds. European Journal of Combinatorics. https://doi.org/10.1016/j.ejc.2025.104122
Alan Frieze, et al. “Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds.” European Journal of Combinatorics, 2025. doi:10.1016/j.ejc.2025.104122.
@article{Frieze2025,
title = {Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds},
author = {Frieze, Alan and Gao, Pu and MacRury, Calum and Prałat, Paweł and Sorkin, Gregory B.},
journal = {European Journal of Combinatorics},
year = {2025},
doi = {10.1016/j.ejc.2025.104122},
url = {https://doi.org/10.1016/j.ejc.2025.104122}
}