3 citations · 4 across the 4 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2013★ 3 cited
Exact counting of Euler Tours for Graphs of Bounded Treewidth
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…
cs.DM2012
The number of Euler tours of a random directed graph
Páidí Creed, Mary Cryan
In this paper we obtain the expectation and variance of the number of Euler tours of a random Eulerian directed graph with fixed out-degree sequence. We use this to obtain the asym…