Note on Counting Eulerian Circuits
Computational Complexity
2007-05-23 v1 Discrete Mathematics
Abstract
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.
Cite
@article{arxiv.cs/0405067,
title = {Note on Counting Eulerian Circuits},
author = {Graham R. Brightwell and Peter Winkler},
journal= {arXiv preprint arXiv:cs/0405067},
year = {2007}
}
Comments
2 figures