2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/32144We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.2 figuresComputational ComplexityDiscrete MathematicsF.2.2; G.2.2text