Systems: graph theory, Hamiltonian Path, logical paradoxes In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected graph that visits each vertex exactly once.