参考文章(45)
Tomasz Łuczak, On Matchings and Hamiltonian Cycles in Subgraphs of Random Graphs North-holland Mathematics Studies. ,vol. 144, pp. 171- 185 ,(1987) , 10.1016/S0304-0208(08)73055-X
L. Bruce Richmond, R.W. Robinson, N.C. Wormald, On Hamilton Cycles in 3-Connected Cubic Maps North-holland Mathematics Studies. ,vol. 115, pp. 141- 149 ,(1985) , 10.1016/S0304-0208(08)73003-2
Michael Sipser, Richard M. Karp, Maximum Matchings in Sparse Random Graphs foundations of computer science. pp. 364- 375 ,(1981)
John Gimbel, David Kurtz, Linda Lesniak, Edward R. Scheinerman, John C. Wierman, Hamiltonian Closure in Random Graphs North-holland Mathematics Studies. ,vol. 144, pp. 59- 67 ,(1987) , 10.1016/S0304-0208(08)73048-2
M. Ajtai, J. Komlós, E. Szeraerédi, First Occurrence of Hamilton Cycles in Random Graphs North-holland Mathematics Studies. ,vol. 115, pp. 173- 178 ,(1985) , 10.1016/S0304-0208(08)73007-X
Richard M. Karp, An Upper Bound on the Expected Cost of an Optimal Assignment Discrete Algorithms and Complexity#R##N#Proceedings of the Japan–US Joint Seminar, June 4–6, 1986, Kyoto, Japan. pp. 1- 4 ,(1987) , 10.1016/B978-0-12-386870-1.50006-X
T. I. Fenner, A. M. Frieze, On the connectivity of randomm-orientable graphs and digraphs Combinatorica. ,vol. 2, pp. 347- 359 ,(1982) , 10.1007/BF02579431
Béla Bollobás, Long paths in sparse random graphs Combinatorica. ,vol. 2, pp. 223- 228 ,(1982) , 10.1007/BF02579230
A.M. Frieze, Limit Distribution for the Existence of Hamiltonian Cycles in Random Bipartite Graphs European Journal of Combinatorics. ,vol. 6, pp. 327- 334 ,(1985) , 10.1016/S0195-6698(85)80046-9
Michael Held, Richard M. Karp, A Dynamic Programming Approach to Sequencing Problems Journal of The Society for Industrial and Applied Mathematics. ,vol. 10, pp. 196- 210 ,(1962) , 10.1137/0110015