Geodesic
Enumeration of labeled Eulerian tetracyclic graphs
Diskretnyj analiz i issledovanie operacij, Tome 21 (2014) no. 5, pp. 17-22

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

We deduce the exact and asymptotical formulas for the number of labeled Eulerian tetracyclic graphs. Ill. 1, tab. 1, bibliogr. 11.
Keywords: enumeration, labeled graph, Eulerian graph, tetracyclic graph, asymptotics. 
@article{DA_2014_21_5_a1,
     author = {V. A. Voblyi and A. K. Meleshko},
     title = {Enumeration of labeled {Eulerian} tetracyclic graphs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {17--22},
     publisher = {mathdoc},
     volume = {21},
     number = {5},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2014_21_5_a1/}
}
TY  - JOUR
AU  - V. A. Voblyi
AU  - A. K. Meleshko
TI  - Enumeration of labeled Eulerian tetracyclic graphs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2014
SP  - 17
EP  - 22
VL  - 21
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2014_21_5_a1/
LA  - ru
ID  - DA_2014_21_5_a1
ER  - 
%0 Journal Article
%A V. A. Voblyi
%A A. K. Meleshko
%T Enumeration of labeled Eulerian tetracyclic graphs
%J Diskretnyj analiz i issledovanie operacij
%D 2014
%P 17-22
%V 21
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2014_21_5_a1/
%G ru
%F DA_2014_21_5_a1
V. A. Voblyi; A. K. Meleshko. Enumeration of labeled Eulerian tetracyclic graphs. Diskretnyj analiz i issledovanie operacij, Tome 21 (2014) no. 5, pp. 17-22. http://geodesic.mathdoc.fr/item/DA_2014_21_5_a1/