Note on Counting Eulerian Circuits
Brightwell, Graham R. · Winkler, Peter
Original · EN
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.