2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/19898A general novel approach mapping discrete, combinatorial, graph-theoretic problems onto ``physical'' models - namely $n$ simplexes in $n-1$ dimensions - is applied to the graph equivalence problem. It is shown to solve this long standing problem in polynomial, short, time.RevTeX4Statistical MechanicsDiscrete MathematicsHigh Energy Physics - PhenomenologyCombinatoricsComputational PhysicsGraph equivalence and characterization via a continuous evolution of a physical analogtext