Journal of Integer Sequences, Vol. 5 (2002), Article 02.2.5

A Note on the Total Number of Double Eulerian Circuits in Multigraphs

Valery Liskovets

Institute of Mathematics
National Academy of Sciences
220072, Minsk

Abstract: 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.

Full version:  pdf,    dvi,    ps,    latex    

(Concerned with sequences A011781 A069736 .)

Received August 1 2002; revised version received November 14 2002. Published in Journal of Integer Sequences December 2, 2002.

Return to Journal of Integer Sequences home page