1. G. N. Bagaev and E. F. Dmitriev, “The Number of Connected Labeled Bipartite Graphs,” Dokl. Akad. Nauk BSSR 28 (12), 1061–1063 (1984).
2. V. A. Voblyi, “Wright and Stepanov–Wright Coefficients,” Mat. Zametki 42 (6), 854–862 (1987) [Math. Notes Acad. Sci. USSR 42 (6), 969–974 (1987)].
3. V. A. Voblyi, “On Enumeration of Labelled Connected Graphs by the Number of Cutpoints,” Diskretn. Mat. 20 (1), 52–63 (2008) [DiscreteMath. Appl. 18 (1), 57–69 (2008)].
4. V. A. Voblyi, “A Formula for the Number of Labeled Connected Graphs,” Diskretn. Anal. Issled. Oper. 19 (4), 48–59 (2012).
5. V. A. Voblyi, “Enumeration of Labeled Connected Bicyclic and Tricyclic Graphs Without Bridges,” Mat. Zametki 91 (2), 308–311 (2012) [Math. Notes 91 (1), 293–297 (2012)].