Note on Counting Eulerian Circuits

Simple item page
dc.creatorBrightwell, Graham R.
dc.creatorWinkler, Peter
dc.date2004-05-18
dc.date.accessioned2026-07-07T03:21:18Z
dc.date.available2026-07-07T03:21:18Z
dc.descriptionWe show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.
dc.description2 figures
dc.identifierhttps://arxiv.org/abs/cs/0405067
dc.identifierhttp://arxiv.org/abs/cs/0405067
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32144
dc.subjectComputational Complexity
dc.subjectDiscrete Mathematics
dc.subjectF.2.2; G.2.2
dc.titleNote on Counting Eulerian Circuits
dc.typetext

Files

Collections

arXiv