Regular graphs in which every pair of points is missed by some longest cycle
Boris Schauerte, Carol T. Zamfirescu · Ghent University Academic Bibliography (Ghent University) · 2006
In Petersen's well-known cubic graph every vertex is missed by some longest cycle.Thomassen produced a planar graph with this property.Grünbaum found a cubic graph, in which any two vertices are missed by some longest cycle.In this paper we present a cubic planar graph fulfilling this condition.