Introduction. The property of the Petersen graph of being hypohamiltonian is notorious, and known for a long time. The existence of hypotraceable graphs, on the contrary, was discovered much later. Before that, in 1966, Gallai [1] had asked the easier question whether (connected) graphs do exist such that each vertex is missed by some longest path. Such graphs have been discovered by Walther in...
