Note on Counting Eulerian Circuits
classification
💻 cs.CC
cs.DM
keywords
circuitscountingeulerianclasscompletegraphnotenumber
read the original abstract
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.