Note on counting Eulerian circuits

Brightwell, G.ORCID logo & 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.
Copy

We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.

Full text not available from this repository.

Export as

EndNote BibTeX Reference Manager Refer Atom Dublin Core JSON Multiline CSV
Export