Author:
Böttcher Julia,Parczyk Olaf,Sgueglia Amedeo,Skokan Jozef
Publisher
Springer International Publishing
Reference18 articles.
1. Aigner, M., Brandt, A.: Embedding arbitrary graphs of maximum degree two. J. London Math. Soc. 48(1), 39–51 (1993). (2)
2. Angluin, D., Valiant, L.G.: Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Comput. System Sci. 18(2), 155–193 (1979)
3. Antoniuk, S., Dudek, A., Reiher, C., Ruciński, A., Schacht, M.: High powers of Hamiltonian cycles in randomly augmented graphs. arXiv:2002.05816 (2020)
4. Bennett, P., Dudek, A., Frieze, A.: Adding random edges to create the square of a Hamilton cycle. arXiv:1710.02716 (2017)
5. Bohman, T., Frieze, A., Martin, R.: How many random edges make a dense graph Hamiltonian? Random Struct. Algorithms 22(1), 33–42 (2003)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献