An untraceable graph is a graph that does not possess a Hamiltonian path, i.e., one that is not traceable. All
disconnected graphs are therefore untraceable.
Untraceable graphs are also known as non-traceable (van Cleemput and Zamfirescu 2018)
or nontraceable graphs.

Precomputed values are available for a number of named graphs using GraphData[graph, "Untraceable"].

The numbers of not-necessarily connected untraceable simple graphs on , 2, ... nodes are 0, 1, 2, 6, 16, 65, 310, 2316, 26241,
522596, ... (OEIS A283420) and the corresponding
numbers of connected untraceable graphs are 0, 0, 0, 1, 3, 21, 119, 1087, 12653,
233999, ... (OEIS A283421), the first few of
which are illustrated above.

There are no untraceable polyhedral graphs on 12 of fewer nodes. Examples of small polyhedral untraceable graphs are given in the
table below.

Sloane, N. J. A. Sequences A283420 and A283421 in "The On-Line Encyclopedia
of Integer Sequences."van Cleemput, N. and Zamfirescu, C. T.
"Regular Non-Hamiltonian Polyhedral Graphs." Appl. Math. Comput.338
192-206, 2018.