Note on Counting Eulerian Circuits
<|reference_start|>Note on Counting Eulerian Circuits: We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.<|reference_end|>
@article{brightwell2004note,
    title={Note on Counting Eulerian Circuits},
    author={Graham R. Brightwell and Peter Winkler},
    journal={arXiv preprint arXiv:cs/0405067},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0405067},
    primaryClass={cs.CC cs.DM}
}