A graph G is a hypotraceable graph if G has no Hamiltonian path (i.e., it is not a traceable graph), but G - v has a Hamiltonian path (i.e., is a traceable graph) for every v element V.

Hamilton-connected graph | hypohamiltonian graph | planar hypotraceable graph | Thomassen graphs | traceable graph | Wiener-Araya graph | Zamfirescu graphs