Author:
Bollobás B.,Fenner T. I.,Frieze A. M.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference13 articles.
1. D. Angluin andL. G. Valiant, Fast probabilistic algorithms for Hamilton circuits and matechings,J. Computer Syst. 18, (1979), 155–193.
2. B. Bollobás, Almost all regular graphs are Hamiltonian,European Journal of Combinatorics 4, (1983), 311–316.
3. B. Bollobás,Random Graphs, Academic Press, London, (1985).
4. B. Bollobás andA. M. Frieze, On matchings and Hamilton cycles in random graphs,Annals of Discrete Mathematics,28 (1985), 23–46.
5. P. Erdős andA. Rényi, On the strength of connectedness of a random graph,Acta. Math. Acad. Sci. Hungar. 12, (1961), 261–267.
Cited by
70 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献