We investigate here the connected graphs with the property that any pair of vertices are missed by some longest paths (or cycles), embeddable in n-dimensional lattices L^n where L denotes the set of integers.
Longest cycles, longest paths, n-dimensional lattices, Gallai's property
"Highly nonconcurrent longest paths and cycles in lattices,"
Turkish Journal of Mathematics: Vol. 38:
3, Article 1.
Available at: https://journals.tubitak.gov.tr/math/vol38/iss3/1