暂无分享,去创建一个
[1] J. A. Bondy,et al. Surveys in Combinatorics, 1991: “A Graph Reconstructor's Manual” , 1991 .
[2] S. Ulam. A collection of mathematical problems , 1960 .
[3] P. Kelly. A congruence theorem for trees. , 1957 .
[4] E. Wright. Graphs on unlabelled nodes with a given number of edges , 1971 .
[5] Vijaya Ramachandran,et al. The diameter of sparse random graphs , 2007, Random Struct. Algorithms.
[6] Paul Erdös,et al. Random Graph Isomorphism , 1980, SIAM J. Comput..
[7] Béla Bollobás. Almost every graph has reconstruction number three , 1990, J. Graph Theory.
[8] John C. Oxtoby,et al. Review: S. M. Ulam, A collection of mathematical problems , 1960 .
[9] R. Otter. The Number of Trees , 1948 .
[10] Boris G. Pittel,et al. On Tree Census and the Giant Component in Sparse Random Graphs , 1990, Random Struct. Algorithms.
[11] Gopal Pandurangan,et al. Improved Random Graph Isomorphism Tomek Czajka , 2006 .
[12] Ludek Kucera,et al. Canonical labeling of regular graphs in linear average time , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).