1. and , Fast probabilistic algorithms for hamiltonian circuits and matchings. In Conf. Rec. Nineth Annual ACM Symp. Theory Comput., Boulder, CO, 1977. ACM, New York (1977) 30–41.
2. The Number of Components in Random Linear Graphs
3. Distribution of the number of vertices in strata of a random connected graph with one cycle. In II Vsesoy. Konf. po Probl. Teoret. Kiber., Novosybirsk (1971) 50 [in Russian].