Note on counting Eulerian circuits
Brightwell, G.
& Winkler, P.
(2004).
Note on counting Eulerian circuits.
(CDAM research report series LSE-CDAM-2004-12).
Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.
| Item Type | Report (Technical Report) |
|---|---|
| Copyright holders | © 2004 the authors |
| Departments | LSE > Academic Departments > Mathematics |
| Date Deposited | 19 Nov 2008 |
| URI | https://researchonline.lse.ac.uk/id/eprint/13350 |
ORCID: https://orcid.org/0000-0001-5955-3628