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.

DOI

10.3906/mat-1302-44

Keywords

Longest cycles, longest paths, n-dimensional lattices, Gallai's property

First Page

375

Last Page

383

Recommended Citation

BASHIR, Y (2014). Highly nonconcurrent longest paths and cycles in lattices. Turkish Journal of Mathematics 38 (3): 375-383. https://doi.org/10.3906/mat-1302-44

Download