Deciding Graph non-Hamiltonicity via a Closure Algorithm

E. R. Swart, S. J. Gismondi, N. R. Swart +2

We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the $n!$ Hamilton cycles in a complete directed graph on $n+1$ vertices corresp…