Geodesic
On the Asymptotic Enumeration of Labeled Connected $k$-Cyclic Graphs without Bridges
Matematičeskie zametki, Tome 107 (2020) no. 2, pp. 304-306

Voir la notice de l'article provenant de la source Math-Net.Ru

Keywords: labeled graph, connected graph, block, graph without bridges, enumeration, asymptotics. 
@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/}
}
TY  - JOUR
AU  - V. A. Voblyi
TI  - On the Asymptotic Enumeration of Labeled Connected $k$-Cyclic Graphs without Bridges
JO  - Matematičeskie zametki
PY  - 2020
SP  - 304
EP  - 306
VL  - 107
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2020_107_2_a12/
LA  - ru
ID  - MZM_2020_107_2_a12
ER  - 
%0 Journal Article
%A V. A. Voblyi
%T On the Asymptotic Enumeration of Labeled Connected $k$-Cyclic Graphs without Bridges
%J Matematičeskie zametki
%D 2020
%P 304-306
%V 107
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2020_107_2_a12/
%G ru
%F 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/