Authors: YASIR BASHIR
Abstract: 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.
Keywords: Longest cycles, longest paths, n-dimensional lattices, Gallai's property
Full Text: PDF