Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. Ajtai, M., Komlós, J., Szemerédi, E.: First Occurrence of Hamilton Cycles In Random Graphs, Cycles in Graphs ’82, North Holland Mathematical Studies, pp. 173–178. North Holland, Amsterdam (1985)
2. Alon, Y., Krivelevich, M.: Random graph’s Hamiltonicity is strongly tied to its minimum degree. Electron. J. Combin. 27, Paper No. 1.30 (2020)
3. Ben-Shimon, S., Krivelevich, M., Sudakov, B.: On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs. SIAM J. Discret. Math. 25, 1176–1193 (2011)
4. Bollobás, B.: The Evolution of Sparse Graphs, Graph Theory and Combinatorics, pp. 35–57. Academic Press, London (1984)
5. Chvátal, V., Erdős, P.: A note on Hamiltonian circuits. Discret. Math. 2, 111–113 (1972)