Geodesic
A note on the total number of double Eulerian circuits in multigraphs
Journal of integer sequences, Tome 5 (2002) no. 2
We formulate explicitly and discuss a simple new enumerative formula for double (directed) eulerian circuits in $n$-edged labeled multigraphs. The formula follows easily from a recent 2-parametric formula of B. Lass.
Classification : 05C30, 05C45
Keywords: double Eulerian circuit, symmetric multidigraph, labeled vertices, root (Concerned with sequences and 
@article{JIS_2002__5_2_a1,
     author = {Liskovets,  Valery},
     title = {A note on the total number of double {Eulerian} circuits in multigraphs},
     journal = {Journal of integer sequences},
     year = {2002},
     volume = {5},
     number = {2},
     zbl = {1012.05090},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/JIS_2002__5_2_a1/}
}
TY  - JOUR
AU  - Liskovets,  Valery
TI  - A note on the total number of double Eulerian circuits in multigraphs
JO  - Journal of integer sequences
PY  - 2002
VL  - 5
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/JIS_2002__5_2_a1/
LA  - en
ID  - JIS_2002__5_2_a1
ER  - 
%0 Journal Article
%A Liskovets,  Valery
%T A note on the total number of double Eulerian circuits in multigraphs
%J Journal of integer sequences
%D 2002
%V 5
%N 2
%U http://geodesic.mathdoc.fr/item/JIS_2002__5_2_a1/
%G en
%F JIS_2002__5_2_a1
Liskovets,  Valery. A note on the total number of double Eulerian circuits in multigraphs. Journal of integer sequences, Tome 5 (2002) no. 2. http://geodesic.mathdoc.fr/item/JIS_2002__5_2_a1/