On a formula for the number of Euler trails for a class of digraphs
Author/Authors :
J Lauri، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1997
Pages :
6
From page :
307
To page :
312
Abstract :
In this note we give an elementary combinatorial proof of a formula of Macris and Pulé for the number of Euler trails in a diagraph all of whose vertices have in-degree and out-degree equal to 2.
