Hamiltonian Closure in Random Graphs
暂无分享,去创建一个
Edward R. Scheinerman | John C. Wierman | Linda Lesniak | John Gimbel | E. Scheinerman | J. Wierman | L. Lesniak | J. Gimbel | David Kurtz | D. Kurtz
[1] E. Palmer. Unsolved Problems in the Theory of Random Graphs , 1987 .
[2] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .
[3] O. Ore. Note on Hamilton Circuits , 1960 .
[4] John Adrian Bondy,et al. A method in graph theory , 1976, Discret. Math..
[5] B. Bollobás. The evolution of random graphs , 1984 .
[6] Béla Bollobás,et al. Degree sequences of random graphs , 1981, Discret. Math..