Voir la notice de l'article provenant de la source Math-Net.Ru
@article{MZM_2020_107_2_a12, author = {V. A. Voblyi}, title = {On the {Asymptotic} {Enumeration} of {Labeled} {Connected} $k${-Cyclic} {Graphs} without {Bridges}}, journal = {Matemati\v{c}eskie zametki}, pages = {304--306}, publisher = {mathdoc}, volume = {107}, number = {2}, year = {2020}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/MZM_2020_107_2_a12/} }
V. A. Voblyi. On the Asymptotic Enumeration of Labeled Connected $k$-Cyclic Graphs without Bridges. Matematičeskie zametki, Tome 107 (2020) no. 2, pp. 304-306. http://geodesic.mathdoc.fr/item/MZM_2020_107_2_a12/
[1] P. Hanlon, R. W. Robinson, J. Combin. Theory Ser. B, 33:1 (1982), 276–305 | DOI | MR | Zbl
[2] The On-Line Encyclopedia of Integer Sequences, http://oeis.org
[3] V. A. Voblyi, Matem. zametki, 91:2 (2012), 308–311 | DOI | MR | Zbl
[4] E. M. Wright, J. Graph Theory, 7:2 (1983), 219–229 | DOI | MR | Zbl
[5] V. A. Voblyi, Matem. zametki, 42:6 (1987), 854–862 | MR | Zbl
[6] V. A. Voblyi, Diskretn. analiz i issled. oper., 23:2 (2016), 5–20 | DOI | MR | Zbl
[7] Dzh. Riordan, Kombinatornye tozhdestva, Nauka, M., 1982 | MR | Zbl
[8] Ph. Flajolet, R. Sedgewick, Analytic Combinatorics, Cambridge Univ. Press, Cambridge, 2009 | MR | Zbl
[9] E. F. Dmitriev, Perechislenie otmechennykh grafov s dannymi strukturnymi svoistvami, Avtoreferat dis. $\dots$ kand. fiz.-matem. nauk, Institut matematiki AN BSSR, Minsk, 1986