There are a number of hypotraceable and hypohamiltonian graphs associated with Carsten
Thomassen. These graphs, illustrated above, are implemented in the Wolfram
Language as GraphData["ThomassenGraphXXX"]
for XXX equal to 20, 24, 32, 60, 94, and 105.
"The" Thomassen graph (Thomassen 1974a) is the hypotraceable
graph on 34 vertices and 52 edges illustrated above in two embeddings.
A number of hypohamiltonian graphs appearing in Thomassen (1974b, 1981, 1974b, 1974b, 1981, 1976, respectively), are illustrated
above.
A number of hypotraceable graphs appearing
in Thomassen (1974a, 1976), respectively, are illustrated above.
Bondy, J. A. and Murty, U. S. R. Graph Theory with Applications. New York: North Holland, p. 240, 1976.Thomassen,
C. "Hypohamiltonian and Hypotraceable Graphs." Disc. Math.9,
91-96, 1974a.Thomassen, C. "On Hypohamiltonian Graphs." Disc.
Math.10, 383-390, 1974b.Thomassen, C. "Planar and Infinite
Hypohamiltonian and Hypotraceable Graphs." Disc. Math14, 377-389,
1976.Thomassen, C. "Planar Cubic Hypohamiltonian and Hypotraceable
Graphs." J. Comb. Th. B30, 36-44, 1981.
