Dergiler / Turkish Journal of Mathematics / 2014 / Cilt: 38 - Sayı: 3
Highly nonconcurrent longest paths and cycles in lattices
- Sayfa
- 375–383
- DOI
- —
Özet
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 Ln where L denotes the set of integers.
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 Ln where L denotes the set of integers.