34 citations · 55 across the 2 of their papers we have counts for
2 papers
cs.CC2004★ 21 cited
Note on Counting Eulerian Circuits
Graham R. Brightwell, Peter Winkler
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.
math.CO2003★ 34 cited
Hard constraints and the bethe lattice: adventures at the interface of combinatorics and statistical physics
Graham R. Brightwell, Peter Winkler
Statistical physics models with hard constraints, such as the discrete hard-core gas model (random independent sets in a graph), are inherently combinatorial and present the discre…