37 citations · 72 across the 10 of their papers we have counts for
1 paper · 2 filters
Prasad Chebolu, Mary Cryan, Russell Martin
In this paper we give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian graph of bounded treewidth. The problems of counting ETs a…