Exact counting of Euler Tours for generalized series-parallel graphs

Prasad Chebolu, Mary Cryan, Russell Martin

We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm…