NP-completeness certificate of a Hamiltonian path

296 Views Asked by At

A Hamiltonian path is a path in a directed , edge positive valued finite graph which visits every vertex exactly once and returns to the original vertex. This should be a NP-complete problem, but I do not see the membership into the class NP: what is the polynomial time verifiable certificate of this problem membership to NP?